./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label48.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/Problem12_label48.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', '6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2'] 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/Problem12_label48.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 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:44:42,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:44:42,838 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:44:42,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:44:42,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:44:42,873 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:44:42,874 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:44:42,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:44:42,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:44:42,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:44:42,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:44:42,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:44:42,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:44:42,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:44:42,875 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:44:42,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:44:42,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:44:42,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:44:42,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:44:42,879 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:44:42,879 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:44:42,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:44:42,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:44:42,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:44:42,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:44:42,881 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:44:42,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:44:42,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:44:42,882 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 -> 6abe6deda42e5cd6457f2c2e337625778fbe4d0886f20421ed4af9df8a9f44a2 [2024-11-06 19:44:43,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:44:43,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:44:43,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:44:43,172 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:44:43,172 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:44:43,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2024-11-06 19:44:44,483 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:44:45,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:44:45,020 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label48.c [2024-11-06 19:44:45,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb568b81b/4e57988ad00b4835ab86ff7779e61c30/FLAG79d766660 [2024-11-06 19:44:45,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bb568b81b/4e57988ad00b4835ab86ff7779e61c30 [2024-11-06 19:44:45,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:44:45,088 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:44:45,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:44:45,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:44:45,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:44:45,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:44:45" (1/1) ... [2024-11-06 19:44:45,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77384649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:45, skipping insertion in model container [2024-11-06 19:44:45,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:44:45" (1/1) ... [2024-11-06 19:44:45,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:44:45,376 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/Problem12_label48.c[1668,1681] [2024-11-06 19:44:45,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:44:45,999 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:44:46,014 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/Problem12_label48.c[1668,1681] [2024-11-06 19:44:46,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:44:46,398 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:44:46,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46 WrapperNode [2024-11-06 19:44:46,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:44:46,401 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:44:46,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:44:46,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:44:46,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:46,485 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:46,830 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:44:46,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:44:46,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:44:46,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:44:46,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:44:46,840 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:46,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:46,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,184 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 19:44:47,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,186 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,389 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:44:47,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:44:47,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:44:47,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:44:47,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (1/1) ... [2024-11-06 19:44:47,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:44:47,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:44:47,524 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 19:44:47,534 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 19:44:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:44:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:44:47,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:44:47,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:44:47,627 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:44:47,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:44:51,995 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:44:51,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:44:52,035 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:44:52,036 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:44:52,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:44:52 BoogieIcfgContainer [2024-11-06 19:44:52,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:44:52,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:44:52,041 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:44:52,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:44:52,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:44:45" (1/3) ... [2024-11-06 19:44:52,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825c295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:44:52, skipping insertion in model container [2024-11-06 19:44:52,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:44:46" (2/3) ... [2024-11-06 19:44:52,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@825c295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:44:52, skipping insertion in model container [2024-11-06 19:44:52,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:44:52" (3/3) ... [2024-11-06 19:44:52,048 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label48.c [2024-11-06 19:44:52,062 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:44:52,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:44:52,145 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:44:52,155 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;@1fa0bd23, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:44:52,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:44:52,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 19:44:52,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-06 19:44:52,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:52,171 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:44:52,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:52,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:52,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1417350502, now seen corresponding path program 1 times [2024-11-06 19:44:52,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:52,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583372702] [2024-11-06 19:44:52,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:52,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:52,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:52,380 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 19:44:52,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:52,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583372702] [2024-11-06 19:44:52,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583372702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:52,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:44:52,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:44:52,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685446936] [2024-11-06 19:44:52,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:52,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:52,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:52,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:52,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:44:52,408 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:44:55,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:55,927 INFO L93 Difference]: Finished difference Result 2388 states and 4629 transitions. [2024-11-06 19:44:55,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-06 19:44:55,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:55,949 INFO L225 Difference]: With dead ends: 2388 [2024-11-06 19:44:55,950 INFO L226 Difference]: Without dead ends: 1506 [2024-11-06 19:44:55,955 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 19:44:55,958 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 824 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:55,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 481 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:44:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-06 19:44:56,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2024-11-06 19:44:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.6385382059800664) internal successors, (2466), 1505 states have internal predecessors, (2466), 0 states have call successors, (0), 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 19:44:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2466 transitions. [2024-11-06 19:44:56,063 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2466 transitions. Word has length 10 [2024-11-06 19:44:56,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:56,063 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2466 transitions. [2024-11-06 19:44:56,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 19:44:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2466 transitions. [2024-11-06 19:44:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-06 19:44:56,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:56,066 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:44:56,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:44:56,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:56,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1004872137, now seen corresponding path program 1 times [2024-11-06 19:44:56,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:56,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043920394] [2024-11-06 19:44:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:44:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:56,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:44:56,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:44:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043920394] [2024-11-06 19:44:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043920394] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:44:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649590208] [2024-11-06 19:44:56,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:56,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:56,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:44:56,594 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 19:44:56,596 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 19:44:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:44:56,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:44:56,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:44:56,716 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:44:56,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:44:56,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649590208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:44:56,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:44:56,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:44:56,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163119696] [2024-11-06 19:44:56,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:44:56,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:44:56,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:44:56,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:44:56,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:44:56,719 INFO L87 Difference]: Start difference. First operand 1506 states and 2466 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:44:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:44:59,706 INFO L93 Difference]: Finished difference Result 4512 states and 7393 transitions. [2024-11-06 19:44:59,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:44:59,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-06 19:44:59,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:44:59,718 INFO L225 Difference]: With dead ends: 4512 [2024-11-06 19:44:59,718 INFO L226 Difference]: Without dead ends: 3008 [2024-11-06 19:44:59,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:44:59,722 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 769 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:44:59,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1391 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:44:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2024-11-06 19:44:59,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 3008. [2024-11-06 19:44:59,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3008 states, 3007 states have (on average 1.3634852011972065) internal successors, (4100), 3007 states have internal predecessors, (4100), 0 states have call successors, (0), 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 19:44:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3008 states to 3008 states and 4100 transitions. [2024-11-06 19:44:59,783 INFO L78 Accepts]: Start accepts. Automaton has 3008 states and 4100 transitions. Word has length 81 [2024-11-06 19:44:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:44:59,784 INFO L471 AbstractCegarLoop]: Abstraction has 3008 states and 4100 transitions. [2024-11-06 19:44:59,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:44:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3008 states and 4100 transitions. [2024-11-06 19:44:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-06 19:44:59,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:44:59,788 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:44:59,805 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 19:44:59,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:44:59,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:44:59,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:44:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2017229475, now seen corresponding path program 1 times [2024-11-06 19:44:59,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:44:59,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353342838] [2024-11-06 19:44:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:44:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:00,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353342838] [2024-11-06 19:45:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353342838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:00,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:00,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:45:00,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245430233] [2024-11-06 19:45:00,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:00,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:00,154 INFO L87 Difference]: Start difference. First operand 3008 states and 4100 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 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 19:45:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:02,800 INFO L93 Difference]: Finished difference Result 7516 states and 10661 transitions. [2024-11-06 19:45:02,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:02,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 84 [2024-11-06 19:45:02,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:02,817 INFO L225 Difference]: With dead ends: 7516 [2024-11-06 19:45:02,818 INFO L226 Difference]: Without dead ends: 4510 [2024-11-06 19:45:02,823 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 19:45:02,824 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:02,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 520 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:45:02,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2024-11-06 19:45:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4510. [2024-11-06 19:45:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4510 states, 4509 states have (on average 1.3251275227323132) internal successors, (5975), 4509 states have internal predecessors, (5975), 0 states have call successors, (0), 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 19:45:02,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4510 states to 4510 states and 5975 transitions. [2024-11-06 19:45:02,935 INFO L78 Accepts]: Start accepts. Automaton has 4510 states and 5975 transitions. Word has length 84 [2024-11-06 19:45:02,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:02,936 INFO L471 AbstractCegarLoop]: Abstraction has 4510 states and 5975 transitions. [2024-11-06 19:45:02,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 0 states have call successors, (0), 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 19:45:02,937 INFO L276 IsEmpty]: Start isEmpty. Operand 4510 states and 5975 transitions. [2024-11-06 19:45:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-06 19:45:02,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:02,940 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:45:02,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:45:02,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:02,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:02,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1374981862, now seen corresponding path program 1 times [2024-11-06 19:45:02,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:02,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036781500] [2024-11-06 19:45:02,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:02,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:03,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:03,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036781500] [2024-11-06 19:45:03,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036781500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627192227] [2024-11-06 19:45:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:03,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:03,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:03,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:03,393 INFO L87 Difference]: Start difference. First operand 4510 states and 5975 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 19:45:07,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:07,259 INFO L93 Difference]: Finished difference Result 14275 states and 18791 transitions. [2024-11-06 19:45:07,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:45:07,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-06 19:45:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:07,289 INFO L225 Difference]: With dead ends: 14275 [2024-11-06 19:45:07,290 INFO L226 Difference]: Without dead ends: 9767 [2024-11-06 19:45:07,294 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 19:45:07,295 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 2162 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 4749 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 5527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 4749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:07,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 185 Invalid, 5527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 4749 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-06 19:45:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-06 19:45:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9016. [2024-11-06 19:45:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.3039378813089295) internal successors, (11755), 9015 states have internal predecessors, (11755), 0 states have call successors, (0), 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 19:45:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 11755 transitions. [2024-11-06 19:45:07,451 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 11755 transitions. Word has length 95 [2024-11-06 19:45:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:07,452 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 11755 transitions. [2024-11-06 19:45:07,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 19:45:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 11755 transitions. [2024-11-06 19:45:07,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-06 19:45:07,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:07,457 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:07,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:45:07,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:07,458 INFO L85 PathProgramCache]: Analyzing trace with hash -259629189, now seen corresponding path program 1 times [2024-11-06 19:45:07,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:07,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613063449] [2024-11-06 19:45:07,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:07,820 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:07,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:07,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613063449] [2024-11-06 19:45:07,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613063449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:07,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:07,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:07,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451201097] [2024-11-06 19:45:07,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:07,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:07,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:07,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:07,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:07,824 INFO L87 Difference]: Start difference. First operand 9016 states and 11755 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 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 19:45:11,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:11,189 INFO L93 Difference]: Finished difference Result 22575 states and 30209 transitions. [2024-11-06 19:45:11,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:45:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 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 149 [2024-11-06 19:45:11,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:11,219 INFO L225 Difference]: With dead ends: 22575 [2024-11-06 19:45:11,220 INFO L226 Difference]: Without dead ends: 12773 [2024-11-06 19:45:11,227 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 19:45:11,228 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 690 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 3806 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 4469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 3806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:11,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 714 Invalid, 4469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 3806 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 19:45:11,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12773 states. [2024-11-06 19:45:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12773 to 12771. [2024-11-06 19:45:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.2173844949099453) internal successors, (15546), 12770 states have internal predecessors, (15546), 0 states have call successors, (0), 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 19:45:11,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 15546 transitions. [2024-11-06 19:45:11,411 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 15546 transitions. Word has length 149 [2024-11-06 19:45:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:11,412 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 15546 transitions. [2024-11-06 19:45:11,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 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 19:45:11,413 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 15546 transitions. [2024-11-06 19:45:11,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-06 19:45:11,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:11,418 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:11,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:45:11,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:11,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1909280368, now seen corresponding path program 1 times [2024-11-06 19:45:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:11,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654250635] [2024-11-06 19:45:11,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:11,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 41 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:11,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654250635] [2024-11-06 19:45:11,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654250635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:45:11,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163193561] [2024-11-06 19:45:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:11,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:11,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:11,919 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:45:11,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:45:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:12,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:45:12,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:45:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:45:12,091 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:45:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163193561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:45:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:45:12,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747637021] [2024-11-06 19:45:12,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:12,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:12,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:12,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:12,097 INFO L87 Difference]: Start difference. First operand 12771 states and 15546 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:14,987 INFO L93 Difference]: Finished difference Result 32299 states and 40261 transitions. [2024-11-06 19:45:14,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:14,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2024-11-06 19:45:14,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:15,032 INFO L225 Difference]: With dead ends: 32299 [2024-11-06 19:45:15,033 INFO L226 Difference]: Without dead ends: 20281 [2024-11-06 19:45:15,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:15,047 INFO L432 NwaCegarLoop]: 964 mSDtfsCounter, 802 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2300 mSolverCounterSat, 745 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 745 IncrementalHoareTripleChecker+Valid, 2300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:15,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 972 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [745 Valid, 2300 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:45:15,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20281 states. [2024-11-06 19:45:15,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20281 to 18779. [2024-11-06 19:45:15,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.2516774949408882) internal successors, (23504), 18778 states have internal predecessors, (23504), 0 states have call successors, (0), 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 19:45:15,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 23504 transitions. [2024-11-06 19:45:15,305 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 23504 transitions. Word has length 240 [2024-11-06 19:45:15,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:15,306 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 23504 transitions. [2024-11-06 19:45:15,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:15,307 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 23504 transitions. [2024-11-06 19:45:15,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-06 19:45:15,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:15,310 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:15,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 19:45:15,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:15,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:15,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:15,512 INFO L85 PathProgramCache]: Analyzing trace with hash -587403453, now seen corresponding path program 1 times [2024-11-06 19:45:15,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112245936] [2024-11-06 19:45:15,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:15,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-06 19:45:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:15,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112245936] [2024-11-06 19:45:15,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112245936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:15,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:15,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:15,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802444000] [2024-11-06 19:45:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:15,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:15,748 INFO L87 Difference]: Start difference. First operand 18779 states and 23504 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 19:45:18,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:18,120 INFO L93 Difference]: Finished difference Result 36805 states and 46250 transitions. [2024-11-06 19:45:18,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:18,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 250 [2024-11-06 19:45:18,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:18,221 INFO L225 Difference]: With dead ends: 36805 [2024-11-06 19:45:18,221 INFO L226 Difference]: Without dead ends: 18779 [2024-11-06 19:45:18,234 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 19:45:18,235 INFO L432 NwaCegarLoop]: 990 mSDtfsCounter, 817 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:18,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 998 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:45:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18779 states. [2024-11-06 19:45:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18779 to 18779. [2024-11-06 19:45:18,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18779 states, 18778 states have (on average 1.193098306528917) internal successors, (22404), 18778 states have internal predecessors, (22404), 0 states have call successors, (0), 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 19:45:18,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18779 states to 18779 states and 22404 transitions. [2024-11-06 19:45:18,436 INFO L78 Accepts]: Start accepts. Automaton has 18779 states and 22404 transitions. Word has length 250 [2024-11-06 19:45:18,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:18,437 INFO L471 AbstractCegarLoop]: Abstraction has 18779 states and 22404 transitions. [2024-11-06 19:45:18,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 19:45:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18779 states and 22404 transitions. [2024-11-06 19:45:18,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-06 19:45:18,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:18,444 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 19:45:18,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:45:18,445 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:18,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:18,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1123992775, now seen corresponding path program 1 times [2024-11-06 19:45:18,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:18,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393879188] [2024-11-06 19:45:18,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:18,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:18,650 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:45:18,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393879188] [2024-11-06 19:45:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393879188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:45:18,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080264638] [2024-11-06 19:45:18,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:18,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:18,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:18,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:18,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:18,653 INFO L87 Difference]: Start difference. First operand 18779 states and 22404 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 19:45:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:21,464 INFO L93 Difference]: Finished difference Result 50325 states and 60873 transitions. [2024-11-06 19:45:21,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:21,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2024-11-06 19:45:21,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:21,519 INFO L225 Difference]: With dead ends: 50325 [2024-11-06 19:45:21,520 INFO L226 Difference]: Without dead ends: 29295 [2024-11-06 19:45:21,539 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 19:45:21,540 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 848 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:21,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 310 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:45:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29295 states. [2024-11-06 19:45:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29295 to 27791. [2024-11-06 19:45:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27791 states, 27790 states have (on average 1.1655631522130263) internal successors, (32391), 27790 states have internal predecessors, (32391), 0 states have call successors, (0), 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 19:45:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27791 states to 27791 states and 32391 transitions. [2024-11-06 19:45:21,910 INFO L78 Accepts]: Start accepts. Automaton has 27791 states and 32391 transitions. Word has length 265 [2024-11-06 19:45:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:21,910 INFO L471 AbstractCegarLoop]: Abstraction has 27791 states and 32391 transitions. [2024-11-06 19:45:21,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 states have internal predecessors, (153), 0 states have call successors, (0), 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 19:45:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 27791 states and 32391 transitions. [2024-11-06 19:45:21,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-06 19:45:21,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:21,918 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-06 19:45:21,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:45:21,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:21,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:21,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1395279574, now seen corresponding path program 1 times [2024-11-06 19:45:21,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:21,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103962287] [2024-11-06 19:45:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 363 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-06 19:45:22,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:22,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103962287] [2024-11-06 19:45:22,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103962287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:22,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:22,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111324789] [2024-11-06 19:45:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:22,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:22,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:22,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:22,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:22,219 INFO L87 Difference]: Start difference. First operand 27791 states and 32391 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 19:45:24,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:24,723 INFO L93 Difference]: Finished difference Result 68347 states and 80741 transitions. [2024-11-06 19:45:24,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:24,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2024-11-06 19:45:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:24,875 INFO L225 Difference]: With dead ends: 68347 [2024-11-06 19:45:24,876 INFO L226 Difference]: Without dead ends: 41309 [2024-11-06 19:45:24,916 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 19:45:24,917 INFO L432 NwaCegarLoop]: 1180 mSDtfsCounter, 704 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:24,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 1188 Invalid, 2509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:24,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41309 states. [2024-11-06 19:45:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41309 to 39807. [2024-11-06 19:45:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39807 states, 39806 states have (on average 1.1482691051600262) internal successors, (45708), 39806 states have internal predecessors, (45708), 0 states have call successors, (0), 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 19:45:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39807 states to 39807 states and 45708 transitions. [2024-11-06 19:45:25,566 INFO L78 Accepts]: Start accepts. Automaton has 39807 states and 45708 transitions. Word has length 377 [2024-11-06 19:45:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:25,567 INFO L471 AbstractCegarLoop]: Abstraction has 39807 states and 45708 transitions. [2024-11-06 19:45:25,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 19:45:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 39807 states and 45708 transitions. [2024-11-06 19:45:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-06 19:45:25,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:25,577 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:25,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:45:25,578 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:25,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:25,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1632296828, now seen corresponding path program 1 times [2024-11-06 19:45:25,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:25,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958545710] [2024-11-06 19:45:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:45:25,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958545710] [2024-11-06 19:45:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958545710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:25,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:25,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775875721] [2024-11-06 19:45:25,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:25,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:25,928 INFO L87 Difference]: Start difference. First operand 39807 states and 45708 transitions. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 19:45:28,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:28,738 INFO L93 Difference]: Finished difference Result 100640 states and 115348 transitions. [2024-11-06 19:45:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2024-11-06 19:45:28,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:28,811 INFO L225 Difference]: With dead ends: 100640 [2024-11-06 19:45:28,811 INFO L226 Difference]: Without dead ends: 61586 [2024-11-06 19:45:28,841 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 19:45:28,842 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 637 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:28,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1172 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:45:28,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61586 states. [2024-11-06 19:45:29,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61586 to 61586. [2024-11-06 19:45:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61586 states, 61585 states have (on average 1.1325485101891695) internal successors, (69748), 61585 states have internal predecessors, (69748), 0 states have call successors, (0), 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 19:45:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61586 states to 61586 states and 69748 transitions. [2024-11-06 19:45:29,687 INFO L78 Accepts]: Start accepts. Automaton has 61586 states and 69748 transitions. Word has length 405 [2024-11-06 19:45:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:29,687 INFO L471 AbstractCegarLoop]: Abstraction has 61586 states and 69748 transitions. [2024-11-06 19:45:29,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 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 19:45:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 61586 states and 69748 transitions. [2024-11-06 19:45:29,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2024-11-06 19:45:29,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:29,694 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:29,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:45:29,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:29,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:29,695 INFO L85 PathProgramCache]: Analyzing trace with hash 462101370, now seen corresponding path program 1 times [2024-11-06 19:45:29,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:29,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241070548] [2024-11-06 19:45:29,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 19:45:30,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:30,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241070548] [2024-11-06 19:45:30,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241070548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:30,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:30,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:45:30,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637259882] [2024-11-06 19:45:30,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:30,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:30,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:30,769 INFO L87 Difference]: Start difference. First operand 61586 states and 69748 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 19:45:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:35,116 INFO L93 Difference]: Finished difference Result 160720 states and 184121 transitions. [2024-11-06 19:45:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:45:35,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 409 [2024-11-06 19:45:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:35,222 INFO L225 Difference]: With dead ends: 160720 [2024-11-06 19:45:35,222 INFO L226 Difference]: Without dead ends: 99887 [2024-11-06 19:45:35,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:35,253 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 2092 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3489 mSolverCounterSat, 1604 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 5093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1604 IncrementalHoareTripleChecker+Valid, 3489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:35,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 125 Invalid, 5093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1604 Valid, 3489 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-06 19:45:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99887 states. [2024-11-06 19:45:36,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99887 to 84116. [2024-11-06 19:45:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84116 states, 84115 states have (on average 1.1417701955655948) internal successors, (96040), 84115 states have internal predecessors, (96040), 0 states have call successors, (0), 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 19:45:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84116 states to 84116 states and 96040 transitions. [2024-11-06 19:45:36,349 INFO L78 Accepts]: Start accepts. Automaton has 84116 states and 96040 transitions. Word has length 409 [2024-11-06 19:45:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:36,349 INFO L471 AbstractCegarLoop]: Abstraction has 84116 states and 96040 transitions. [2024-11-06 19:45:36,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 19:45:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 84116 states and 96040 transitions. [2024-11-06 19:45:36,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2024-11-06 19:45:36,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:36,359 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:36,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:45:36,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:36,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:36,359 INFO L85 PathProgramCache]: Analyzing trace with hash 273957708, now seen corresponding path program 1 times [2024-11-06 19:45:36,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:36,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359675014] [2024-11-06 19:45:36,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:36,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-11-06 19:45:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:36,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359675014] [2024-11-06 19:45:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359675014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:36,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595234669] [2024-11-06 19:45:36,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:36,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:36,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:36,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:36,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:36,671 INFO L87 Difference]: Start difference. First operand 84116 states and 96040 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 19:45:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:39,778 INFO L93 Difference]: Finished difference Result 202025 states and 231821 transitions. [2024-11-06 19:45:39,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:39,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 424 [2024-11-06 19:45:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:39,912 INFO L225 Difference]: With dead ends: 202025 [2024-11-06 19:45:39,913 INFO L226 Difference]: Without dead ends: 118662 [2024-11-06 19:45:39,951 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 19:45:39,951 INFO L432 NwaCegarLoop]: 1236 mSDtfsCounter, 786 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 643 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:39,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1244 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [643 Valid, 2111 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:45:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118662 states. [2024-11-06 19:45:41,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118662 to 111903. [2024-11-06 19:45:41,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111903 states, 111902 states have (on average 1.1181480223767224) internal successors, (125123), 111902 states have internal predecessors, (125123), 0 states have call successors, (0), 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 19:45:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111903 states to 111903 states and 125123 transitions. [2024-11-06 19:45:41,385 INFO L78 Accepts]: Start accepts. Automaton has 111903 states and 125123 transitions. Word has length 424 [2024-11-06 19:45:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:41,386 INFO L471 AbstractCegarLoop]: Abstraction has 111903 states and 125123 transitions. [2024-11-06 19:45:41,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 19:45:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 111903 states and 125123 transitions. [2024-11-06 19:45:41,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-11-06 19:45:41,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:41,392 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-06 19:45:41,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:45:41,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:41,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash -744188340, now seen corresponding path program 1 times [2024-11-06 19:45:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:41,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092057906] [2024-11-06 19:45:41,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:41,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 373 proven. 54 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:45:42,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092057906] [2024-11-06 19:45:42,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092057906] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:45:42,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208783325] [2024-11-06 19:45:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:42,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:42,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:42,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:45:42,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:45:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:42,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:45:42,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:45:43,030 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-06 19:45:43,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:45:43,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208783325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:43,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:45:43,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-11-06 19:45:43,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430175444] [2024-11-06 19:45:43,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:43,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:43,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:43,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:43,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:45:43,033 INFO L87 Difference]: Start difference. First operand 111903 states and 125123 transitions. Second operand has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 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 19:45:47,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:47,447 INFO L93 Difference]: Finished difference Result 244832 states and 273432 transitions. [2024-11-06 19:45:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:45:47,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2024-11-06 19:45:47,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:47,602 INFO L225 Difference]: With dead ends: 244832 [2024-11-06 19:45:47,602 INFO L226 Difference]: Without dead ends: 133682 [2024-11-06 19:45:47,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:45:47,674 INFO L432 NwaCegarLoop]: 431 mSDtfsCounter, 1381 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 4368 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 5050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 4368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:47,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 445 Invalid, 5050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 4368 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 19:45:47,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133682 states. [2024-11-06 19:45:49,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133682 to 129927. [2024-11-06 19:45:49,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129927 states, 129926 states have (on average 1.0972784508104614) internal successors, (142565), 129926 states have internal predecessors, (142565), 0 states have call successors, (0), 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 19:45:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129927 states to 129927 states and 142565 transitions. [2024-11-06 19:45:49,320 INFO L78 Accepts]: Start accepts. Automaton has 129927 states and 142565 transitions. Word has length 432 [2024-11-06 19:45:49,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:49,321 INFO L471 AbstractCegarLoop]: Abstraction has 129927 states and 142565 transitions. [2024-11-06 19:45:49,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.25) internal successors, (293), 4 states have internal predecessors, (293), 0 states have call successors, (0), 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 19:45:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 129927 states and 142565 transitions. [2024-11-06 19:45:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2024-11-06 19:45:49,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:49,333 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 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] [2024-11-06 19:45:49,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 19:45:49,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:49,534 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:49,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:49,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1595808735, now seen corresponding path program 1 times [2024-11-06 19:45:49,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:49,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097618784] [2024-11-06 19:45:49,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:49,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-06 19:45:50,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097618784] [2024-11-06 19:45:50,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097618784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:50,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:50,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:50,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657431781] [2024-11-06 19:45:50,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:50,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:50,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:50,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:50,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:50,053 INFO L87 Difference]: Start difference. First operand 129927 states and 142565 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 19:45:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:52,773 INFO L93 Difference]: Finished difference Result 261354 states and 286682 transitions. [2024-11-06 19:45:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 466 [2024-11-06 19:45:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:52,927 INFO L225 Difference]: With dead ends: 261354 [2024-11-06 19:45:52,927 INFO L226 Difference]: Without dead ends: 132180 [2024-11-06 19:45:52,989 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 19:45:52,989 INFO L432 NwaCegarLoop]: 990 mSDtfsCounter, 746 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:52,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 997 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:45:53,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132180 states. [2024-11-06 19:45:54,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132180 to 129176. [2024-11-06 19:45:54,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129176 states, 129175 states have (on average 1.0805573833946196) internal successors, (139581), 129175 states have internal predecessors, (139581), 0 states have call successors, (0), 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 19:45:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129176 states to 129176 states and 139581 transitions. [2024-11-06 19:45:54,329 INFO L78 Accepts]: Start accepts. Automaton has 129176 states and 139581 transitions. Word has length 466 [2024-11-06 19:45:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:54,329 INFO L471 AbstractCegarLoop]: Abstraction has 129176 states and 139581 transitions. [2024-11-06 19:45:54,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 19:45:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 129176 states and 139581 transitions. [2024-11-06 19:45:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2024-11-06 19:45:54,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:54,340 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:54,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:45:54,341 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:54,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:54,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1341420984, now seen corresponding path program 1 times [2024-11-06 19:45:54,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:54,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654861] [2024-11-06 19:45:54,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:54,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:54,926 INFO L134 CoverageAnalysis]: Checked inductivity of 858 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2024-11-06 19:45:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654861] [2024-11-06 19:45:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:54,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:54,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:54,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902319759] [2024-11-06 19:45:54,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:54,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:54,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:54,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:54,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:54,929 INFO L87 Difference]: Start difference. First operand 129176 states and 139581 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 19:45:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:58,140 INFO L93 Difference]: Finished difference Result 260603 states and 281436 transitions. [2024-11-06 19:45:58,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:58,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 517 [2024-11-06 19:45:58,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:58,294 INFO L225 Difference]: With dead ends: 260603 [2024-11-06 19:45:58,294 INFO L226 Difference]: Without dead ends: 132180 [2024-11-06 19:45:58,355 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 19:45:58,356 INFO L432 NwaCegarLoop]: 1179 mSDtfsCounter, 694 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2376 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 2376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:58,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 1187 Invalid, 2842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 2376 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:45:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132180 states. [2024-11-06 19:45:59,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132180 to 127674. [2024-11-06 19:45:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127674 states, 127673 states have (on average 1.0727013542409123) internal successors, (136955), 127673 states have internal predecessors, (136955), 0 states have call successors, (0), 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 19:45:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127674 states to 127674 states and 136955 transitions. [2024-11-06 19:45:59,926 INFO L78 Accepts]: Start accepts. Automaton has 127674 states and 136955 transitions. Word has length 517 [2024-11-06 19:45:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:59,926 INFO L471 AbstractCegarLoop]: Abstraction has 127674 states and 136955 transitions. [2024-11-06 19:45:59,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 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 19:45:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 127674 states and 136955 transitions. [2024-11-06 19:45:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2024-11-06 19:45:59,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:59,938 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:45:59,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:45:59,938 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:59,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1307422627, now seen corresponding path program 1 times [2024-11-06 19:45:59,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:59,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682359976] [2024-11-06 19:45:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:46:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:46:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2024-11-06 19:46:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:46:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682359976] [2024-11-06 19:46:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682359976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:46:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:46:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:46:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191148999] [2024-11-06 19:46:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:46:00,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:46:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:46:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:46:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:46:00,603 INFO L87 Difference]: Start difference. First operand 127674 states and 136955 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)