./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label49.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/eca-rers2012/Problem16_label49.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', '4910e0bbb7a4c656d48064116d1212b3394ff1881ffffb38aebc0e1b0fb73ac8'] 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/eca-rers2012/Problem16_label49.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 4910e0bbb7a4c656d48064116d1212b3394ff1881ffffb38aebc0e1b0fb73ac8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:03:10,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:03:11,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:03:11,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:03:11,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:03:11,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:03:11,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:03:11,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:03:11,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:03:11,075 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:03:11,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:03:11,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:03:11,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:03:11,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:03:11,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:03:11,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:03:11,077 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:03:11,077 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 -> 4910e0bbb7a4c656d48064116d1212b3394ff1881ffffb38aebc0e1b0fb73ac8 [2024-11-06 20:03:11,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:03:11,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:03:11,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:03:11,292 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:03:11,292 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:03:11,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label49.c [2024-11-06 20:03:12,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:03:12,787 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:03:12,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label49.c [2024-11-06 20:03:12,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff37e55e/900f9816c1e74a2ba583585e2874e5ed/FLAG9d5398dff [2024-11-06 20:03:13,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ff37e55e/900f9816c1e74a2ba583585e2874e5ed [2024-11-06 20:03:13,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:03:13,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:03:13,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:03:13,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:03:13,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:03:13,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4efc3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13, skipping insertion in model container [2024-11-06 20:03:13,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:03:13,186 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/eca-rers2012/Problem16_label49.c[6302,6315] [2024-11-06 20:03:13,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:03:13,375 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:03:13,395 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/eca-rers2012/Problem16_label49.c[6302,6315] [2024-11-06 20:03:13,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:03:13,513 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:03:13,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13 WrapperNode [2024-11-06 20:03:13,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:03:13,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:03:13,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:03:13,515 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:03:13,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,544 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,662 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-06 20:03:13,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:03:13,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:03:13,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:03:13,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:03:13,669 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,682 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,714 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-06 20:03:13,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,746 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,764 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:03:13,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:03:13,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:03:13,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:03:13,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (1/1) ... [2024-11-06 20:03:13,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:03:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:03:13,802 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-06 20:03:13,804 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-06 20:03:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:03:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:03:13,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:03:13,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:03:13,871 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:03:13,873 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:03:15,463 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-06 20:03:15,464 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:03:15,476 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:03:15,476 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:03:15,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:03:15 BoogieIcfgContainer [2024-11-06 20:03:15,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:03:15,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:03:15,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:03:15,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:03:15,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:03:13" (1/3) ... [2024-11-06 20:03:15,482 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfd3c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:03:15, skipping insertion in model container [2024-11-06 20:03:15,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:03:13" (2/3) ... [2024-11-06 20:03:15,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cfd3c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:03:15, skipping insertion in model container [2024-11-06 20:03:15,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:03:15" (3/3) ... [2024-11-06 20:03:15,484 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label49.c [2024-11-06 20:03:15,494 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:03:15,495 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:03:15,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:03:15,563 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;@7952321d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:03:15,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:03:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:15,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-06 20:03:15,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:15,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:15,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash -634083006, now seen corresponding path program 1 times [2024-11-06 20:03:15,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:15,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417513386] [2024-11-06 20:03:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:15,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:15,872 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-06 20:03:15,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:15,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417513386] [2024-11-06 20:03:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417513386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:03:15,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016433949] [2024-11-06 20:03:15,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:15,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:15,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:15,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:15,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:15,896 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-06 20:03:17,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:17,329 INFO L93 Difference]: Finished difference Result 1122 states and 2103 transitions. [2024-11-06 20:03:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-06 20:03:17,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:17,344 INFO L225 Difference]: With dead ends: 1122 [2024-11-06 20:03:17,344 INFO L226 Difference]: Without dead ends: 662 [2024-11-06 20:03:17,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:03:17,351 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 300 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:17,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:03:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-06 20:03:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-06 20:03:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 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-06 20:03:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2024-11-06 20:03:17,400 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 60 [2024-11-06 20:03:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:17,401 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2024-11-06 20:03:17,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 2 states have internal predecessors, (60), 0 states have call successors, (0), 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-06 20:03:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2024-11-06 20:03:17,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-06 20:03:17,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:17,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:17,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:03:17,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:17,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:17,405 INFO L85 PathProgramCache]: Analyzing trace with hash 45144985, now seen corresponding path program 1 times [2024-11-06 20:03:17,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:17,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633778509] [2024-11-06 20:03:17,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:17,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:03:17,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633778509] [2024-11-06 20:03:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633778509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:03:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634565585] [2024-11-06 20:03:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:17,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:17,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:17,585 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:18,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:18,618 INFO L93 Difference]: Finished difference Result 1651 states and 2539 transitions. [2024-11-06 20:03:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:18,619 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2024-11-06 20:03:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:18,622 INFO L225 Difference]: With dead ends: 1651 [2024-11-06 20:03:18,623 INFO L226 Difference]: Without dead ends: 991 [2024-11-06 20:03:18,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:03:18,624 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:18,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:03:18,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-06 20:03:18,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2024-11-06 20:03:18,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3767676767676769) internal successors, (1363), 990 states have internal predecessors, (1363), 0 states have call successors, (0), 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-06 20:03:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1363 transitions. [2024-11-06 20:03:18,643 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1363 transitions. Word has length 131 [2024-11-06 20:03:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:18,643 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1363 transitions. [2024-11-06 20:03:18,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1363 transitions. [2024-11-06 20:03:18,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-06 20:03:18,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:18,645 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:18,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:03:18,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:18,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash 643763922, now seen corresponding path program 1 times [2024-11-06 20:03:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:18,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423112041] [2024-11-06 20:03:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:18,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:03:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:18,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423112041] [2024-11-06 20:03:18,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423112041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:18,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:18,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:03:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225250438] [2024-11-06 20:03:18,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:18,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:18,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:18,817 INFO L87 Difference]: Start difference. First operand 991 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:19,864 INFO L93 Difference]: Finished difference Result 2967 states and 4084 transitions. [2024-11-06 20:03:19,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:19,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132 [2024-11-06 20:03:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:19,869 INFO L225 Difference]: With dead ends: 2967 [2024-11-06 20:03:19,870 INFO L226 Difference]: Without dead ends: 1978 [2024-11-06 20:03:19,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:03:19,871 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:19,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 211 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:03:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-06 20:03:19,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-06 20:03:19,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.2463328275164391) internal successors, (2464), 1977 states have internal predecessors, (2464), 0 states have call successors, (0), 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-06 20:03:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2464 transitions. [2024-11-06 20:03:19,894 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2464 transitions. Word has length 132 [2024-11-06 20:03:19,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:19,895 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2464 transitions. [2024-11-06 20:03:19,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2464 transitions. [2024-11-06 20:03:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-06 20:03:19,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:19,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:03:19,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:03:19,898 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1201112245, now seen corresponding path program 1 times [2024-11-06 20:03:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201321718] [2024-11-06 20:03:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-06 20:03:20,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:20,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201321718] [2024-11-06 20:03:20,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201321718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:20,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:20,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:03:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233564917] [2024-11-06 20:03:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:20,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:20,107 INFO L87 Difference]: Start difference. First operand 1978 states and 2464 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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-06 20:03:21,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:21,317 INFO L93 Difference]: Finished difference Result 4612 states and 5849 transitions. [2024-11-06 20:03:21,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:21,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-11-06 20:03:21,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:21,325 INFO L225 Difference]: With dead ends: 4612 [2024-11-06 20:03:21,325 INFO L226 Difference]: Without dead ends: 2636 [2024-11-06 20:03:21,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:03:21,327 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:21,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:03:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-06 20:03:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2307. [2024-11-06 20:03:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.2350390286209887) internal successors, (2848), 2306 states have internal predecessors, (2848), 0 states have call successors, (0), 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-06 20:03:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 2848 transitions. [2024-11-06 20:03:21,358 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 2848 transitions. Word has length 215 [2024-11-06 20:03:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:21,358 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 2848 transitions. [2024-11-06 20:03:21,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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-06 20:03:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 2848 transitions. [2024-11-06 20:03:21,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2024-11-06 20:03:21,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:21,362 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:03:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:03:21,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:21,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:21,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2074011705, now seen corresponding path program 1 times [2024-11-06 20:03:21,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:21,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428018453] [2024-11-06 20:03:21,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:21,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-06 20:03:21,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:21,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428018453] [2024-11-06 20:03:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428018453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:21,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:21,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:03:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182721050] [2024-11-06 20:03:21,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:21,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:21,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:21,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:21,714 INFO L87 Difference]: Start difference. First operand 2307 states and 2848 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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-06 20:03:22,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:22,899 INFO L93 Difference]: Finished difference Result 6915 states and 8539 transitions. [2024-11-06 20:03:22,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:22,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 392 [2024-11-06 20:03:22,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:22,910 INFO L225 Difference]: With dead ends: 6915 [2024-11-06 20:03:22,910 INFO L226 Difference]: Without dead ends: 4610 [2024-11-06 20:03:22,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-06 20:03:22,913 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 252 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 939 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:22,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 121 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 939 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:03:22,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2024-11-06 20:03:22,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4281. [2024-11-06 20:03:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2121495327102805) internal successors, (5188), 4280 states have internal predecessors, (5188), 0 states have call successors, (0), 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-06 20:03:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5188 transitions. [2024-11-06 20:03:22,992 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5188 transitions. Word has length 392 [2024-11-06 20:03:22,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:22,992 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5188 transitions. [2024-11-06 20:03:22,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 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-06 20:03:22,992 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5188 transitions. [2024-11-06 20:03:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2024-11-06 20:03:22,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:22,998 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:22,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:03:22,998 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:22,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:22,999 INFO L85 PathProgramCache]: Analyzing trace with hash -569327500, now seen corresponding path program 1 times [2024-11-06 20:03:22,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:22,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611545779] [2024-11-06 20:03:22,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:22,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-06 20:03:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611545779] [2024-11-06 20:03:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611545779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:23,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:23,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956817753] [2024-11-06 20:03:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:23,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:03:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:03:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:03:23,565 INFO L87 Difference]: Start difference. First operand 4281 states and 5188 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-06 20:03:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:24,726 INFO L93 Difference]: Finished difference Result 8889 states and 10715 transitions. [2024-11-06 20:03:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:03:24,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2024-11-06 20:03:24,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:24,735 INFO L225 Difference]: With dead ends: 8889 [2024-11-06 20:03:24,735 INFO L226 Difference]: Without dead ends: 4610 [2024-11-06 20:03:24,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:03:24,739 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:24,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:03:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2024-11-06 20:03:24,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2024-11-06 20:03:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.198307658928184) internal successors, (5523), 4609 states have internal predecessors, (5523), 0 states have call successors, (0), 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-06 20:03:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5523 transitions. [2024-11-06 20:03:24,814 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5523 transitions. Word has length 483 [2024-11-06 20:03:24,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:24,815 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 5523 transitions. [2024-11-06 20:03:24,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-06 20:03:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5523 transitions. [2024-11-06 20:03:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2024-11-06 20:03:24,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:24,823 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:24,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:03:24,823 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:24,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:24,824 INFO L85 PathProgramCache]: Analyzing trace with hash -741185691, now seen corresponding path program 1 times [2024-11-06 20:03:24,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:24,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401492146] [2024-11-06 20:03:24,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:24,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-06 20:03:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:25,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401492146] [2024-11-06 20:03:25,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401492146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:25,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:25,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 20:03:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782523006] [2024-11-06 20:03:25,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:25,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 20:03:25,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:25,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 20:03:25,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:03:25,361 INFO L87 Difference]: Start difference. First operand 4610 states and 5523 transitions. Second operand has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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-06 20:03:26,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:26,557 INFO L93 Difference]: Finished difference Result 8748 states and 10556 transitions. [2024-11-06 20:03:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 20:03:26,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 570 [2024-11-06 20:03:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:26,570 INFO L225 Difference]: With dead ends: 8748 [2024-11-06 20:03:26,570 INFO L226 Difference]: Without dead ends: 4281 [2024-11-06 20:03:26,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:03:26,573 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 308 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 2012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:26,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 286 Invalid, 2012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:03:26,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-11-06 20:03:26,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2024-11-06 20:03:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.0771028037383177) internal successors, (4610), 4280 states have internal predecessors, (4610), 0 states have call successors, (0), 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-06 20:03:26,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 4610 transitions. [2024-11-06 20:03:26,613 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 4610 transitions. Word has length 570 [2024-11-06 20:03:26,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:26,614 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 4610 transitions. [2024-11-06 20:03:26,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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-06 20:03:26,614 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 4610 transitions. [2024-11-06 20:03:26,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2024-11-06 20:03:26,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:26,620 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:26,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:03:26,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:26,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1564191677, now seen corresponding path program 1 times [2024-11-06 20:03:26,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:26,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870204172] [2024-11-06 20:03:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-06 20:03:27,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:27,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870204172] [2024-11-06 20:03:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870204172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:27,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:27,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:27,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889050547] [2024-11-06 20:03:27,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:27,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:03:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:03:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:03:27,307 INFO L87 Difference]: Start difference. First operand 4281 states and 4610 transitions. Second operand has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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-06 20:03:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:28,723 INFO L93 Difference]: Finished difference Result 12179 states and 13189 transitions. [2024-11-06 20:03:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:03:28,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 598 [2024-11-06 20:03:28,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:28,742 INFO L225 Difference]: With dead ends: 12179 [2024-11-06 20:03:28,742 INFO L226 Difference]: Without dead ends: 8229 [2024-11-06 20:03:28,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:03:28,748 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 402 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:28,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 90 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:03:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2024-11-06 20:03:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 7900. [2024-11-06 20:03:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0724142296493226) internal successors, (8471), 7899 states have internal predecessors, (8471), 0 states have call successors, (0), 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-06 20:03:28,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8471 transitions. [2024-11-06 20:03:28,830 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8471 transitions. Word has length 598 [2024-11-06 20:03:28,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:28,830 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8471 transitions. [2024-11-06 20:03:28,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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-06 20:03:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8471 transitions. [2024-11-06 20:03:28,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2024-11-06 20:03:28,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:28,841 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:28,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:03:28,841 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:28,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -260815485, now seen corresponding path program 1 times [2024-11-06 20:03:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:28,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699821754] [2024-11-06 20:03:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:29,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 910 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-06 20:03:29,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:29,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699821754] [2024-11-06 20:03:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699821754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:29,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:29,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362077840] [2024-11-06 20:03:29,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:29,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:29,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:29,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:29,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:29,258 INFO L87 Difference]: Start difference. First operand 7900 states and 8471 transitions. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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-06 20:03:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:29,936 INFO L93 Difference]: Finished difference Result 18430 states and 19933 transitions. [2024-11-06 20:03:29,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 702 [2024-11-06 20:03:29,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:29,950 INFO L225 Difference]: With dead ends: 18430 [2024-11-06 20:03:29,950 INFO L226 Difference]: Without dead ends: 11190 [2024-11-06 20:03:29,955 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-06 20:03:29,956 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 224 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:29,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 38 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:03:29,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2024-11-06 20:03:30,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190. [2024-11-06 20:03:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.0761462150326213) internal successors, (12041), 11189 states have internal predecessors, (12041), 0 states have call successors, (0), 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-06 20:03:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 12041 transitions. [2024-11-06 20:03:30,041 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 12041 transitions. Word has length 702 [2024-11-06 20:03:30,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:30,041 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 12041 transitions. [2024-11-06 20:03:30,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 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-06 20:03:30,042 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 12041 transitions. [2024-11-06 20:03:30,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 822 [2024-11-06 20:03:30,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:30,050 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:03:30,050 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:30,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:30,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2072847100, now seen corresponding path program 1 times [2024-11-06 20:03:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006051690] [2024-11-06 20:03:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1676 backedges. 1004 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-06 20:03:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:30,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006051690] [2024-11-06 20:03:30,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006051690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:30,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:30,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:30,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959910075] [2024-11-06 20:03:30,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:30,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:03:30,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:03:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:03:30,728 INFO L87 Difference]: Start difference. First operand 11190 states and 12041 transitions. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-06 20:03:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:31,626 INFO L93 Difference]: Finished difference Result 21720 states and 23413 transitions. [2024-11-06 20:03:31,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:31,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 821 [2024-11-06 20:03:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:31,643 INFO L225 Difference]: With dead ends: 21720 [2024-11-06 20:03:31,643 INFO L226 Difference]: Without dead ends: 11190 [2024-11-06 20:03:31,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:03:31,655 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:31,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 118 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 20:03:31,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2024-11-06 20:03:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190. [2024-11-06 20:03:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.0758780945571544) internal successors, (12038), 11189 states have internal predecessors, (12038), 0 states have call successors, (0), 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-06 20:03:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 12038 transitions. [2024-11-06 20:03:31,761 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 12038 transitions. Word has length 821 [2024-11-06 20:03:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:31,762 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 12038 transitions. [2024-11-06 20:03:31,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 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-06 20:03:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 12038 transitions. [2024-11-06 20:03:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2024-11-06 20:03:31,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:31,775 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:31,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:03:31,776 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:31,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash 559782894, now seen corresponding path program 1 times [2024-11-06 20:03:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:31,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366952868] [2024-11-06 20:03:31,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:31,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1737 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-06 20:03:32,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:32,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366952868] [2024-11-06 20:03:32,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366952868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:32,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727247896] [2024-11-06 20:03:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:32,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:32,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:32,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:32,150 INFO L87 Difference]: Start difference. First operand 11190 states and 12038 transitions. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-06 20:03:32,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:32,863 INFO L93 Difference]: Finished difference Result 24352 states and 26363 transitions. [2024-11-06 20:03:32,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:32,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 882 [2024-11-06 20:03:32,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:32,903 INFO L225 Difference]: With dead ends: 24352 [2024-11-06 20:03:32,907 INFO L226 Difference]: Without dead ends: 13822 [2024-11-06 20:03:32,920 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-06 20:03:32,923 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:32,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 437 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 20:03:32,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-11-06 20:03:33,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2024-11-06 20:03:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0656385322494872) internal successors, (14027), 13163 states have internal predecessors, (14027), 0 states have call successors, (0), 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-06 20:03:33,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 14027 transitions. [2024-11-06 20:03:33,113 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 14027 transitions. Word has length 882 [2024-11-06 20:03:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:33,115 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 14027 transitions. [2024-11-06 20:03:33,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 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-06 20:03:33,115 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 14027 transitions. [2024-11-06 20:03:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2024-11-06 20:03:33,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:33,124 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:33,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:03:33,124 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:33,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -558799337, now seen corresponding path program 1 times [2024-11-06 20:03:33,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:33,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360276464] [2024-11-06 20:03:33,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:33,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:33,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1742 backedges. 680 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-11-06 20:03:33,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:33,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360276464] [2024-11-06 20:03:33,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360276464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:33,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662792296] [2024-11-06 20:03:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:33,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:33,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:33,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:33,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:33,494 INFO L87 Difference]: Start difference. First operand 13164 states and 14027 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-06 20:03:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:34,447 INFO L93 Difference]: Finished difference Result 30603 states and 32692 transitions. [2024-11-06 20:03:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:34,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 883 [2024-11-06 20:03:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:34,478 INFO L225 Difference]: With dead ends: 30603 [2024-11-06 20:03:34,481 INFO L226 Difference]: Without dead ends: 16125 [2024-11-06 20:03:34,504 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-06 20:03:34,504 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 270 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:34,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 20:03:34,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2024-11-06 20:03:34,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2024-11-06 20:03:34,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0506698089804019) internal successors, (16941), 16124 states have internal predecessors, (16941), 0 states have call successors, (0), 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-06 20:03:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16941 transitions. [2024-11-06 20:03:34,762 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16941 transitions. Word has length 883 [2024-11-06 20:03:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:34,767 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16941 transitions. [2024-11-06 20:03:34,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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-06 20:03:34,767 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16941 transitions. [2024-11-06 20:03:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1153 [2024-11-06 20:03:34,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:34,792 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:03:34,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:03:34,794 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:34,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1596182599, now seen corresponding path program 1 times [2024-11-06 20:03:34,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:34,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367800213] [2024-11-06 20:03:34,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:34,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2622 backedges. 1377 proven. 0 refuted. 0 times theorem prover too weak. 1245 trivial. 0 not checked. [2024-11-06 20:03:35,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:35,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367800213] [2024-11-06 20:03:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367800213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:35,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967854679] [2024-11-06 20:03:35,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:35,831 INFO L87 Difference]: Start difference. First operand 16125 states and 16941 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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-06 20:03:36,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:36,449 INFO L93 Difference]: Finished difference Result 31590 states and 33216 transitions. [2024-11-06 20:03:36,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:36,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1152 [2024-11-06 20:03:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:36,464 INFO L225 Difference]: With dead ends: 31590 [2024-11-06 20:03:36,464 INFO L226 Difference]: Without dead ends: 16125 [2024-11-06 20:03:36,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-06 20:03:36,472 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:36,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:03:36,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2024-11-06 20:03:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 15796. [2024-11-06 20:03:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0457106679328902) internal successors, (16517), 15795 states have internal predecessors, (16517), 0 states have call successors, (0), 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-06 20:03:36,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16517 transitions. [2024-11-06 20:03:36,572 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16517 transitions. Word has length 1152 [2024-11-06 20:03:36,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:36,573 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16517 transitions. [2024-11-06 20:03:36,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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-06 20:03:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16517 transitions. [2024-11-06 20:03:36,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2024-11-06 20:03:36,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:36,587 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-06 20:03:36,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:03:36,587 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:36,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1481143585, now seen corresponding path program 1 times [2024-11-06 20:03:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620310134] [2024-11-06 20:03:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3152 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1884 trivial. 0 not checked. [2024-11-06 20:03:37,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:37,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620310134] [2024-11-06 20:03:37,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620310134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:37,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:37,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:37,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382574870] [2024-11-06 20:03:37,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:37,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:37,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:37,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:37,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:37,060 INFO L87 Difference]: Start difference. First operand 15796 states and 16517 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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-06 20:03:37,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:37,723 INFO L93 Difference]: Finished difference Result 33893 states and 35500 transitions. [2024-11-06 20:03:37,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1220 [2024-11-06 20:03:37,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:37,736 INFO L225 Difference]: With dead ends: 33893 [2024-11-06 20:03:37,736 INFO L226 Difference]: Without dead ends: 16454 [2024-11-06 20:03:37,744 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-06 20:03:37,744 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 272 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:37,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 412 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:03:37,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2024-11-06 20:03:37,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 14480. [2024-11-06 20:03:37,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0384004420194766) internal successors, (15035), 14479 states have internal predecessors, (15035), 0 states have call successors, (0), 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-06 20:03:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15035 transitions. [2024-11-06 20:03:37,840 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15035 transitions. Word has length 1220 [2024-11-06 20:03:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:37,841 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15035 transitions. [2024-11-06 20:03:37,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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-06 20:03:37,841 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15035 transitions. [2024-11-06 20:03:37,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1340 [2024-11-06 20:03:37,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:37,857 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:03:37,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:03:37,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:37,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1963580381, now seen corresponding path program 1 times [2024-11-06 20:03:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866363452] [2024-11-06 20:03:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:37,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:38,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4263 backedges. 2785 proven. 0 refuted. 0 times theorem prover too weak. 1478 trivial. 0 not checked. [2024-11-06 20:03:38,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:38,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866363452] [2024-11-06 20:03:38,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866363452] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:38,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:38,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:38,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249795618] [2024-11-06 20:03:38,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:38,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:38,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:38,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:38,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:38,319 INFO L87 Difference]: Start difference. First operand 14480 states and 15035 transitions. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 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-06 20:03:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:38,954 INFO L93 Difference]: Finished difference Result 29287 states and 30429 transitions. [2024-11-06 20:03:38,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:38,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1339 [2024-11-06 20:03:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:38,968 INFO L225 Difference]: With dead ends: 29287 [2024-11-06 20:03:38,968 INFO L226 Difference]: Without dead ends: 15467 [2024-11-06 20:03:38,976 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-06 20:03:38,977 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 193 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:38,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 416 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:03:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2024-11-06 20:03:39,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 14809. [2024-11-06 20:03:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.033698001080497) internal successors, (15307), 14808 states have internal predecessors, (15307), 0 states have call successors, (0), 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-06 20:03:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15307 transitions. [2024-11-06 20:03:39,066 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15307 transitions. Word has length 1339 [2024-11-06 20:03:39,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:39,067 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15307 transitions. [2024-11-06 20:03:39,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 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-06 20:03:39,067 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15307 transitions. [2024-11-06 20:03:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1369 [2024-11-06 20:03:39,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:39,080 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:03:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:03:39,081 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2004844002, now seen corresponding path program 1 times [2024-11-06 20:03:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:39,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922791560] [2024-11-06 20:03:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:39,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:39,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4391 backedges. 2941 proven. 0 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2024-11-06 20:03:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922791560] [2024-11-06 20:03:39,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922791560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:39,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:39,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:03:39,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574285940] [2024-11-06 20:03:39,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:39,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:39,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:39,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:39,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:03:39,736 INFO L87 Difference]: Start difference. First operand 14809 states and 15307 transitions. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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-06 20:03:40,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:40,425 INFO L93 Difference]: Finished difference Result 28958 states and 29948 transitions. [2024-11-06 20:03:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:40,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1368 [2024-11-06 20:03:40,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:40,437 INFO L225 Difference]: With dead ends: 28958 [2024-11-06 20:03:40,437 INFO L226 Difference]: Without dead ends: 14809 [2024-11-06 20:03:40,444 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-06 20:03:40,446 INFO L432 NwaCegarLoop]: 413 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:40,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 419 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:03:40,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2024-11-06 20:03:40,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14480. [2024-11-06 20:03:40,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0275571517369984) internal successors, (14878), 14479 states have internal predecessors, (14878), 0 states have call successors, (0), 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-06 20:03:40,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14878 transitions. [2024-11-06 20:03:40,524 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14878 transitions. Word has length 1368 [2024-11-06 20:03:40,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:40,525 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14878 transitions. [2024-11-06 20:03:40,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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-06 20:03:40,525 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14878 transitions. [2024-11-06 20:03:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2024-11-06 20:03:40,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:40,538 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:03:40,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 20:03:40,538 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:40,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:40,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1348184464, now seen corresponding path program 1 times [2024-11-06 20:03:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:40,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921419520] [2024-11-06 20:03:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:40,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 763 proven. 1373 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2024-11-06 20:03:41,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921419520] [2024-11-06 20:03:41,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921419520] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:03:41,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136718198] [2024-11-06 20:03:41,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:41,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:03:41,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:03:41,580 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-06 20:03:41,581 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-06 20:03:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:41,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 1587 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:03:41,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:03:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3502 backedges. 812 proven. 0 refuted. 0 times theorem prover too weak. 2690 trivial. 0 not checked. [2024-11-06 20:03:42,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:03:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136718198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:03:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-06 20:03:42,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110688729] [2024-11-06 20:03:42,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:42,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:03:42,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:42,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:03:42,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:03:42,007 INFO L87 Difference]: Start difference. First operand 14480 states and 14878 transitions. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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-06 20:03:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:42,664 INFO L93 Difference]: Finished difference Result 28629 states and 29423 transitions. [2024-11-06 20:03:42,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:03:42,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1378 [2024-11-06 20:03:42,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:42,674 INFO L225 Difference]: With dead ends: 28629 [2024-11-06 20:03:42,674 INFO L226 Difference]: Without dead ends: 14480 [2024-11-06 20:03:42,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1383 GetRequests, 1379 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:03:42,683 INFO L432 NwaCegarLoop]: 359 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:42,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 364 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:03:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-06 20:03:42,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2024-11-06 20:03:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0230678914289661) internal successors, (14813), 14479 states have internal predecessors, (14813), 0 states have call successors, (0), 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-06 20:03:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14813 transitions. [2024-11-06 20:03:42,791 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14813 transitions. Word has length 1378 [2024-11-06 20:03:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:42,792 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14813 transitions. [2024-11-06 20:03:42,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 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-06 20:03:42,792 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14813 transitions. [2024-11-06 20:03:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1707 [2024-11-06 20:03:42,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:03:42,815 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:42,829 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-06 20:03:43,019 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,SelfDestructingSolverStorable16 [2024-11-06 20:03:43,020 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:03:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:03:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1513951258, now seen corresponding path program 1 times [2024-11-06 20:03:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:03:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404315590] [2024-11-06 20:03:43,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:03:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:03:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:03:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4877 backedges. 2119 proven. 0 refuted. 0 times theorem prover too weak. 2758 trivial. 0 not checked. [2024-11-06 20:03:43,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:03:43,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404315590] [2024-11-06 20:03:43,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404315590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:03:43,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:03:43,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 20:03:43,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215796196] [2024-11-06 20:03:43,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:03:43,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 20:03:43,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:03:43,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 20:03:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:03:43,989 INFO L87 Difference]: Start difference. First operand 14480 states and 14813 transitions. Second operand has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:03:45,525 INFO L93 Difference]: Finished difference Result 28831 states and 29493 transitions. [2024-11-06 20:03:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 20:03:45,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1706 [2024-11-06 20:03:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:03:45,527 INFO L225 Difference]: With dead ends: 28831 [2024-11-06 20:03:45,527 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 20:03:45,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:03:45,537 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 51 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 2943 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:03:45,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 448 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2943 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:03:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 20:03:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 20:03:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 20:03:45,538 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1706 [2024-11-06 20:03:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:03:45,538 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 20:03:45,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:03:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 20:03:45,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 20:03:45,543 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 20:03:45,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:03:45,546 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:03:45,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 20:03:46,484 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 20:03:46,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:03:46 BoogieIcfgContainer [2024-11-06 20:03:46,502 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 20:03:46,502 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 20:03:46,503 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 20:03:46,503 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 20:03:46,503 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:03:15" (3/4) ... [2024-11-06 20:03:46,505 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 20:03:46,527 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 20:03:46,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 20:03:46,530 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 20:03:46,531 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 20:03:46,666 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 20:03:46,670 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 20:03:46,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 20:03:46,671 INFO L158 Benchmark]: Toolchain (without parser) took 33645.70ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 112.5MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 508.1MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,671 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 20:03:46,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 488.40ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 56.4MB in the end (delta: 56.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.29ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 95.6MB in the end (delta: -39.2MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,672 INFO L158 Benchmark]: Boogie Preprocessor took 115.73ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 61.4MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,672 INFO L158 Benchmark]: RCFGBuilder took 1696.84ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 61.4MB in the beginning and 103.0MB in the end (delta: -41.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,672 INFO L158 Benchmark]: TraceAbstraction took 31023.88ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 103.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 405.4MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,672 INFO L158 Benchmark]: Witness Printer took 167.50ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 20:03:46,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.57ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 488.40ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 56.4MB in the end (delta: 56.0MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.29ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 95.6MB in the end (delta: -39.2MB). Peak memory consumption was 29.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.73ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 61.4MB in the end (delta: 34.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1696.84ms. Allocated memory was 142.6MB in the beginning and 209.7MB in the end (delta: 67.1MB). Free memory was 61.4MB in the beginning and 103.0MB in the end (delta: -41.6MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31023.88ms. Allocated memory was 209.7MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 103.0MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 405.4MB. Max. memory is 16.1GB. * Witness Printer took 167.50ms. Allocated memory is still 2.1GB. Free memory was 1.6GB in the beginning and 1.5GB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 197]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.0s, OverallIterations: 18, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4332 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4332 mSDsluCounter, 4945 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 2828 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18928 IncrementalHoareTripleChecker+Invalid, 21756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2828 mSolverCounterUnsat, 4738 mSDtfsCounter, 18928 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1440 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16125occurred in iteration=12, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 4935 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 15410 NumberOfCodeBlocks, 15410 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 15391 ConstructedInterpolants, 0 QuantifiedInterpolants, 33789 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1587 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 33955/35328 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a12 <= 5) && (a16 == 8)) || ((a12 == 9) && (a16 == 9))) || ((a16 == 8) && (a15 <= 3))) || (((0 <= ((long long) 87 + a18)) && (5 == a12)) && (a15 == 3))) || ((a16 == 8) && (a12 == 6))) || ((a16 == 8) && (7 == a12))) || (((0 <= ((long long) 87 + a18)) && (a16 == 9)) && (a15 <= 3))) || (((5 == a12) && (a15 == 3)) && (11 <= a16))) || ((((a12 == 9) && (a15 <= 3)) && (((long long) 87 + a18) <= 0)) && (a16 <= 11))) || (((((a15 <= 3) && (((long long) 87 + a18) <= 0)) && (a12 <= 7)) && (a16 <= 11)) && (6 <= a12))) || ((a16 == 9) && (a12 == 8))) || ((a16 == 8) && (a12 == 8))) || ((a15 <= 3) && (a12 == 8))) || ((a12 == 9) && (a16 == 8))) || (((a15 <= 3) && (11 <= a16)) && (7 == a12))) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 6))) || (((a12 == 9) && (a15 <= 3)) && (11 <= a16))) || (((a16 == 10) && (a15 != 3)) && (a12 <= 7))) || ((a16 == 9) && (a12 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-06 20:03:46,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE