./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label02.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/Problem15_label02.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', '252caf568f55ccc117f08f171449ba48170f0a66dff72163b7ceb4914a3f7685'] 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/Problem15_label02.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 252caf568f55ccc117f08f171449ba48170f0a66dff72163b7ceb4914a3f7685 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:55:02,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:55:02,256 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:55:02,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:55:02,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:55:02,280 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:55:02,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:55:02,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:55:02,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:55:02,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:55:02,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:55:02,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:55:02,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:55:02,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:55:02,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:55:02,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:55:02,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:55:02,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:55:02,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:55:02,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:55:02,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:55:02,283 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 -> 252caf568f55ccc117f08f171449ba48170f0a66dff72163b7ceb4914a3f7685 [2024-11-06 19:55:02,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:55:02,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:55:02,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:55:02,503 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:55:02,503 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:55:02,505 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label02.c [2024-11-06 19:55:03,692 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:55:04,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:55:04,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label02.c [2024-11-06 19:55:04,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2887aad5/45bc5d1b9f3849349127f0b6c4dafd3d/FLAGff051cd98 [2024-11-06 19:55:04,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f2887aad5/45bc5d1b9f3849349127f0b6c4dafd3d [2024-11-06 19:55:04,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:55:04,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:55:04,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:55:04,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:55:04,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:55:04,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:04,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc2568c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04, skipping insertion in model container [2024-11-06 19:55:04,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:04,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:55:04,246 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/Problem15_label02.c[3558,3571] [2024-11-06 19:55:04,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:55:04,531 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:55:04,548 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/Problem15_label02.c[3558,3571] [2024-11-06 19:55:04,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:55:04,674 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:55:04,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04 WrapperNode [2024-11-06 19:55:04,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:55:04,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:55:04,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:55:04,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:55:04,680 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:55:04" (1/1) ... [2024-11-06 19:55:04,705 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:55:04" (1/1) ... [2024-11-06 19:55:04,897 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:55:04,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:55:04,900 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:55:04,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:55:04,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:55:04,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:04,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:04,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,005 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:55:05,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,124 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,185 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:55:05,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:55:05,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:55:05,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:55:05,191 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (1/1) ... [2024-11-06 19:55:05,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:55:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:05,245 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:55:05,254 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:55:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:55:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:55:05,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:55:05,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:55:05,322 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:55:05,324 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:55:07,439 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:55:07,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:55:07,458 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:55:07,459 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:55:07,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:07 BoogieIcfgContainer [2024-11-06 19:55:07,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:55:07,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:55:07,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:55:07,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:55:07,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:55:04" (1/3) ... [2024-11-06 19:55:07,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e44a1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:07, skipping insertion in model container [2024-11-06 19:55:07,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:55:04" (2/3) ... [2024-11-06 19:55:07,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e44a1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:55:07, skipping insertion in model container [2024-11-06 19:55:07,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:55:07" (3/3) ... [2024-11-06 19:55:07,466 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label02.c [2024-11-06 19:55:07,476 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:55:07,476 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:55:07,517 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:55:07,524 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;@36ac9f7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:55:07,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:55:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states 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:55:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 19:55:07,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:07,533 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:07,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:07,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash -716875070, now seen corresponding path program 1 times [2024-11-06 19:55:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:07,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902495755] [2024-11-06 19:55:07,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:07,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:07,704 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:55:07,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:07,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902495755] [2024-11-06 19:55:07,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902495755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:07,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:07,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:07,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442079049] [2024-11-06 19:55:07,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:07,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:07,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:07,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:07,723 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:55:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:09,537 INFO L93 Difference]: Finished difference Result 1191 states and 2157 transitions. [2024-11-06 19:55:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-06 19:55:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:09,549 INFO L225 Difference]: With dead ends: 1191 [2024-11-06 19:55:09,549 INFO L226 Difference]: Without dead ends: 688 [2024-11-06 19:55:09,553 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:55:09,555 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 343 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:09,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 19:55:09,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2024-11-06 19:55:09,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2024-11-06 19:55:09,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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:55:09,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2024-11-06 19:55:09,599 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 28 [2024-11-06 19:55:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:09,600 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2024-11-06 19:55:09,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states 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:55:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2024-11-06 19:55:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-06 19:55:09,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:09,602 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:09,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:55:09,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:09,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1168160975, now seen corresponding path program 1 times [2024-11-06 19:55:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393248005] [2024-11-06 19:55:09,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393248005] [2024-11-06 19:55:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393248005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:09,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464343621] [2024-11-06 19:55:09,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:09,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:09,789 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:11,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:11,081 INFO L93 Difference]: Finished difference Result 1964 states and 3171 transitions. [2024-11-06 19:55:11,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:11,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2024-11-06 19:55:11,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:11,086 INFO L225 Difference]: With dead ends: 1964 [2024-11-06 19:55:11,086 INFO L226 Difference]: Without dead ends: 1286 [2024-11-06 19:55:11,088 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:55:11,090 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:11,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:55:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2024-11-06 19:55:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 1281. [2024-11-06 19:55:11,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.3953125) internal successors, (1786), 1280 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states 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:55:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1786 transitions. [2024-11-06 19:55:11,118 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1786 transitions. Word has length 96 [2024-11-06 19:55:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:11,122 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1786 transitions. [2024-11-06 19:55:11,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1786 transitions. [2024-11-06 19:55:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-06 19:55:11,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:11,125 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:11,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:55:11,125 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:11,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:11,125 INFO L85 PathProgramCache]: Analyzing trace with hash -996245475, now seen corresponding path program 1 times [2024-11-06 19:55:11,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:11,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256690997] [2024-11-06 19:55:11,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:11,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:11,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:11,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256690997] [2024-11-06 19:55:11,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256690997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:11,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:11,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:11,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752652862] [2024-11-06 19:55:11,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:11,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:11,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:11,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:11,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:11,297 INFO L87 Difference]: Start difference. First operand 1281 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:12,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:12,648 INFO L93 Difference]: Finished difference Result 3766 states and 5246 transitions. [2024-11-06 19:55:12,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:12,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-06 19:55:12,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:12,656 INFO L225 Difference]: With dead ends: 3766 [2024-11-06 19:55:12,656 INFO L226 Difference]: Without dead ends: 2487 [2024-11-06 19:55:12,657 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:55:12,658 INFO L432 NwaCegarLoop]: 600 mSDtfsCounter, 300 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:12,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 637 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:55:12,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-11-06 19:55:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2487. [2024-11-06 19:55:12,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.244569589702333) internal successors, (3094), 2486 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states 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:55:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3094 transitions. [2024-11-06 19:55:12,693 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3094 transitions. Word has length 104 [2024-11-06 19:55:12,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:12,694 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3094 transitions. [2024-11-06 19:55:12,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3094 transitions. [2024-11-06 19:55:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-06 19:55:12,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:12,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:12,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:55:12,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:12,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:12,700 INFO L85 PathProgramCache]: Analyzing trace with hash 165774961, now seen corresponding path program 1 times [2024-11-06 19:55:12,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:12,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228078744] [2024-11-06 19:55:12,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:12,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:12,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:12,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228078744] [2024-11-06 19:55:12,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228078744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:12,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:12,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:12,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405434887] [2024-11-06 19:55:12,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:12,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:12,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:12,836 INFO L87 Difference]: Start difference. First operand 2487 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:14,007 INFO L93 Difference]: Finished difference Result 6173 states and 7859 transitions. [2024-11-06 19:55:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2024-11-06 19:55:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:14,017 INFO L225 Difference]: With dead ends: 6173 [2024-11-06 19:55:14,018 INFO L226 Difference]: Without dead ends: 3688 [2024-11-06 19:55:14,019 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:55:14,021 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 234 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:14,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 363 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:55:14,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3688 states. [2024-11-06 19:55:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3688 to 3686. [2024-11-06 19:55:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3685 states have (on average 1.198100407055631) internal successors, (4415), 3685 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states 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:55:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4415 transitions. [2024-11-06 19:55:14,071 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4415 transitions. Word has length 110 [2024-11-06 19:55:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:14,072 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4415 transitions. [2024-11-06 19:55:14,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4415 transitions. [2024-11-06 19:55:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-06 19:55:14,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:14,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:14,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:55:14,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:14,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:14,075 INFO L85 PathProgramCache]: Analyzing trace with hash 393462226, now seen corresponding path program 1 times [2024-11-06 19:55:14,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:14,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837177696] [2024-11-06 19:55:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:14,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-06 19:55:14,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837177696] [2024-11-06 19:55:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837177696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:14,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:14,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:14,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220735892] [2024-11-06 19:55:14,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:14,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:14,397 INFO L87 Difference]: Start difference. First operand 3686 states and 4415 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:55:15,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:15,777 INFO L93 Difference]: Finished difference Result 10069 states and 12098 transitions. [2024-11-06 19:55:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 224 [2024-11-06 19:55:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:15,805 INFO L225 Difference]: With dead ends: 10069 [2024-11-06 19:55:15,809 INFO L226 Difference]: Without dead ends: 6385 [2024-11-06 19:55:15,816 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:55:15,817 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 117 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:15,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 317 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:55:15,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6385 states. [2024-11-06 19:55:15,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6385 to 5485. [2024-11-06 19:55:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5484 states have (on average 1.1706783369803064) internal successors, (6420), 5484 states have internal predecessors, (6420), 0 states have call successors, (0), 0 states 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:55:15,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 6420 transitions. [2024-11-06 19:55:15,899 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 6420 transitions. Word has length 224 [2024-11-06 19:55:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:15,899 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 6420 transitions. [2024-11-06 19:55:15,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states 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:55:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 6420 transitions. [2024-11-06 19:55:15,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-06 19:55:15,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:15,904 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:15,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:55:15,904 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:15,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:15,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1062253043, now seen corresponding path program 1 times [2024-11-06 19:55:15,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:15,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847234333] [2024-11-06 19:55:15,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:15,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:15,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:55:16,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847234333] [2024-11-06 19:55:16,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847234333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:16,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:16,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:55:16,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237766708] [2024-11-06 19:55:16,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:16,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:16,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:16,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:16,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:16,368 INFO L87 Difference]: Start difference. First operand 5485 states and 6420 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:55:17,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:17,436 INFO L93 Difference]: Finished difference Result 11267 states and 13149 transitions. [2024-11-06 19:55:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 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 289 [2024-11-06 19:55:17,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:17,448 INFO L225 Difference]: With dead ends: 11267 [2024-11-06 19:55:17,449 INFO L226 Difference]: Without dead ends: 5784 [2024-11-06 19:55:17,453 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:55:17,454 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:17,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:55:17,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-11-06 19:55:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5784. [2024-11-06 19:55:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5784 states, 5783 states have (on average 1.162891232924088) internal successors, (6725), 5783 states have internal predecessors, (6725), 0 states have call successors, (0), 0 states 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:55:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5784 states to 5784 states and 6725 transitions. [2024-11-06 19:55:17,506 INFO L78 Accepts]: Start accepts. Automaton has 5784 states and 6725 transitions. Word has length 289 [2024-11-06 19:55:17,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:17,507 INFO L471 AbstractCegarLoop]: Abstraction has 5784 states and 6725 transitions. [2024-11-06 19:55:17,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 2 states have internal predecessors, (264), 0 states have call successors, (0), 0 states 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:55:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 5784 states and 6725 transitions. [2024-11-06 19:55:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2024-11-06 19:55:17,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:17,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:55:17,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:55:17,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:17,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:17,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1396843262, now seen corresponding path program 1 times [2024-11-06 19:55:17,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:17,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825851144] [2024-11-06 19:55:17,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:17,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:17,754 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:55:17,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:17,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825851144] [2024-11-06 19:55:17,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825851144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:17,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:17,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:17,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216510524] [2024-11-06 19:55:17,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:17,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:17,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:17,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:17,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:17,758 INFO L87 Difference]: Start difference. First operand 5784 states and 6725 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:18,952 INFO L93 Difference]: Finished difference Result 13360 states and 15778 transitions. [2024-11-06 19:55:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 315 [2024-11-06 19:55:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:18,968 INFO L225 Difference]: With dead ends: 13360 [2024-11-06 19:55:18,968 INFO L226 Difference]: Without dead ends: 7877 [2024-11-06 19:55:18,972 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:55:18,973 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 287 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:18,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 322 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:55:18,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7877 states. [2024-11-06 19:55:19,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7877 to 5182. [2024-11-06 19:55:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5182 states, 5181 states have (on average 1.1721675352248602) internal successors, (6073), 5181 states have internal predecessors, (6073), 0 states have call successors, (0), 0 states 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:55:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5182 states to 5182 states and 6073 transitions. [2024-11-06 19:55:19,026 INFO L78 Accepts]: Start accepts. Automaton has 5182 states and 6073 transitions. Word has length 315 [2024-11-06 19:55:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:19,026 INFO L471 AbstractCegarLoop]: Abstraction has 5182 states and 6073 transitions. [2024-11-06 19:55:19,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5182 states and 6073 transitions. [2024-11-06 19:55:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2024-11-06 19:55:19,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:19,029 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:19,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:55:19,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:19,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:19,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1845872633, now seen corresponding path program 1 times [2024-11-06 19:55:19,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:19,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155445626] [2024-11-06 19:55:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 51 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:19,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:19,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155445626] [2024-11-06 19:55:19,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155445626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:19,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912511721] [2024-11-06 19:55:19,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:19,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:19,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:19,688 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:55:19,689 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:55:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:19,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 19:55:19,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:20,261 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:20,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:55:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:21,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912511721] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:21,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 19:55:21,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 9 [2024-11-06 19:55:21,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356636619] [2024-11-06 19:55:21,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:21,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 19:55:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:21,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 19:55:21,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:55:21,646 INFO L87 Difference]: Start difference. First operand 5182 states and 6073 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:55:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:24,595 INFO L93 Difference]: Finished difference Result 14882 states and 17736 transitions. [2024-11-06 19:55:24,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:55:24,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 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 375 [2024-11-06 19:55:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:24,620 INFO L225 Difference]: With dead ends: 14882 [2024-11-06 19:55:24,620 INFO L226 Difference]: Without dead ends: 10001 [2024-11-06 19:55:24,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 752 GetRequests, 744 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2024-11-06 19:55:24,624 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 755 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1355 mSolverCounterSat, 1277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 2632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1277 IncrementalHoareTripleChecker+Valid, 1355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:24,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 85 Invalid, 2632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1277 Valid, 1355 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:55:24,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10001 states. [2024-11-06 19:55:24,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10001 to 8479. [2024-11-06 19:55:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8479 states, 8478 states have (on average 1.2098372257607926) internal successors, (10257), 8478 states have internal predecessors, (10257), 0 states have call successors, (0), 0 states 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:55:24,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8479 states to 8479 states and 10257 transitions. [2024-11-06 19:55:24,723 INFO L78 Accepts]: Start accepts. Automaton has 8479 states and 10257 transitions. Word has length 375 [2024-11-06 19:55:24,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:24,723 INFO L471 AbstractCegarLoop]: Abstraction has 8479 states and 10257 transitions. [2024-11-06 19:55:24,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 4 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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:55:24,723 INFO L276 IsEmpty]: Start isEmpty. Operand 8479 states and 10257 transitions. [2024-11-06 19:55:24,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-06 19:55:24,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:24,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:24,743 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:55:24,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:24,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:24,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:24,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1882825898, now seen corresponding path program 1 times [2024-11-06 19:55:24,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456302072] [2024-11-06 19:55:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:24,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456302072] [2024-11-06 19:55:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456302072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:25,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:25,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990974412] [2024-11-06 19:55:25,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:25,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:25,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:25,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:25,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:25,353 INFO L87 Difference]: Start difference. First operand 8479 states and 10257 transitions. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states 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:55:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:26,526 INFO L93 Difference]: Finished difference Result 19655 states and 24324 transitions. [2024-11-06 19:55:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:26,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 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 391 [2024-11-06 19:55:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:26,543 INFO L225 Difference]: With dead ends: 19655 [2024-11-06 19:55:26,544 INFO L226 Difference]: Without dead ends: 11477 [2024-11-06 19:55:26,550 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:55:26,551 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 246 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:26,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 602 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:55:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11477 states. [2024-11-06 19:55:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11477 to 10577. [2024-11-06 19:55:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10577 states, 10576 states have (on average 1.1915658093797277) internal successors, (12602), 10576 states have internal predecessors, (12602), 0 states have call successors, (0), 0 states 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:55:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10577 states to 10577 states and 12602 transitions. [2024-11-06 19:55:26,646 INFO L78 Accepts]: Start accepts. Automaton has 10577 states and 12602 transitions. Word has length 391 [2024-11-06 19:55:26,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:26,646 INFO L471 AbstractCegarLoop]: Abstraction has 10577 states and 12602 transitions. [2024-11-06 19:55:26,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states 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:55:26,647 INFO L276 IsEmpty]: Start isEmpty. Operand 10577 states and 12602 transitions. [2024-11-06 19:55:26,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-06 19:55:26,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:26,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:26,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:55:26,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:26,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash -396217123, now seen corresponding path program 1 times [2024-11-06 19:55:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923174910] [2024-11-06 19:55:26,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:26,851 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-06 19:55:26,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:26,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923174910] [2024-11-06 19:55:26,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923174910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:26,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:26,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:26,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356446116] [2024-11-06 19:55:26,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:26,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:26,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:26,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:26,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:26,854 INFO L87 Difference]: Start difference. First operand 10577 states and 12602 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:27,993 INFO L93 Difference]: Finished difference Result 24142 states and 29345 transitions. [2024-11-06 19:55:27,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:27,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 405 [2024-11-06 19:55:27,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:28,026 INFO L225 Difference]: With dead ends: 24142 [2024-11-06 19:55:28,029 INFO L226 Difference]: Without dead ends: 13866 [2024-11-06 19:55:28,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:55:28,046 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 300 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:28,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 616 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:55:28,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13866 states. [2024-11-06 19:55:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13866 to 13264. [2024-11-06 19:55:28,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13264 states, 13263 states have (on average 1.172811581090251) internal successors, (15555), 13263 states have internal predecessors, (15555), 0 states have call successors, (0), 0 states 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:55:28,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13264 states to 13264 states and 15555 transitions. [2024-11-06 19:55:28,199 INFO L78 Accepts]: Start accepts. Automaton has 13264 states and 15555 transitions. Word has length 405 [2024-11-06 19:55:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:28,200 INFO L471 AbstractCegarLoop]: Abstraction has 13264 states and 15555 transitions. [2024-11-06 19:55:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 13264 states and 15555 transitions. [2024-11-06 19:55:28,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-11-06 19:55:28,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:28,207 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:55:28,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -908400451, now seen corresponding path program 1 times [2024-11-06 19:55:28,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:28,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305018805] [2024-11-06 19:55:28,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:28,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 26 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305018805] [2024-11-06 19:55:28,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305018805] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95155298] [2024-11-06 19:55:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:28,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:28,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:28,781 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:55:28,785 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:55:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:28,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 19:55:28,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 204 proven. 106 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:55:29,491 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:55:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 204 proven. 106 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:55:31,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95155298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:55:31,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:55:31,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2024-11-06 19:55:31,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317497152] [2024-11-06 19:55:31,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:55:31,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 19:55:31,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:31,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 19:55:31,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:55:31,381 INFO L87 Difference]: Start difference. First operand 13264 states and 15555 transitions. Second operand has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:41,201 INFO L93 Difference]: Finished difference Result 64035 states and 73510 transitions. [2024-11-06 19:55:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 19:55:41,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 482 [2024-11-06 19:55:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:41,253 INFO L225 Difference]: With dead ends: 64035 [2024-11-06 19:55:41,253 INFO L226 Difference]: Without dead ends: 51072 [2024-11-06 19:55:41,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 981 GetRequests, 960 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2024-11-06 19:55:41,268 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 5108 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 8596 mSolverCounterSat, 3209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5108 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 11805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3209 IncrementalHoareTripleChecker+Valid, 8596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:41,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5108 Valid, 321 Invalid, 11805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3209 Valid, 8596 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-06 19:55:41,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51072 states. [2024-11-06 19:55:41,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51072 to 40508. [2024-11-06 19:55:41,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40508 states, 40507 states have (on average 1.1425185770360677) internal successors, (46280), 40507 states have internal predecessors, (46280), 0 states have call successors, (0), 0 states 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:55:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40508 states to 40508 states and 46280 transitions. [2024-11-06 19:55:41,674 INFO L78 Accepts]: Start accepts. Automaton has 40508 states and 46280 transitions. Word has length 482 [2024-11-06 19:55:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:41,674 INFO L471 AbstractCegarLoop]: Abstraction has 40508 states and 46280 transitions. [2024-11-06 19:55:41,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.22222222222223) internal successors, (1046), 8 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:55:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 40508 states and 46280 transitions. [2024-11-06 19:55:41,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2024-11-06 19:55:41,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:41,678 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:41,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:55:41,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:41,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:41,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash 332439731, now seen corresponding path program 1 times [2024-11-06 19:55:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:41,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897733021] [2024-11-06 19:55:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:42,259 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 312 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:55:42,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897733021] [2024-11-06 19:55:42,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897733021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:42,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799838957] [2024-11-06 19:55:42,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:42,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:42,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:42,262 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:55:42,263 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:55:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:42,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:55:42,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 312 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:55:42,994 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:55:43,523 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 312 proven. 39 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 19:55:43,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799838957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:55:43,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:55:43,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2024-11-06 19:55:43,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397882086] [2024-11-06 19:55:43,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:55:43,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 19:55:43,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:43,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 19:55:43,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:55:43,525 INFO L87 Difference]: Start difference. First operand 40508 states and 46280 transitions. Second operand has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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:55:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:47,964 INFO L93 Difference]: Finished difference Result 84468 states and 95951 transitions. [2024-11-06 19:55:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 19:55:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 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 488 [2024-11-06 19:55:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:47,993 INFO L225 Difference]: With dead ends: 84468 [2024-11-06 19:55:47,993 INFO L226 Difference]: Without dead ends: 30936 [2024-11-06 19:55:48,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2024-11-06 19:55:48,019 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 2701 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 5874 mSolverCounterSat, 782 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2701 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 6656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 782 IncrementalHoareTripleChecker+Valid, 5874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:48,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2701 Valid, 240 Invalid, 6656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [782 Valid, 5874 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-06 19:55:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30936 states. [2024-11-06 19:55:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30936 to 21343. [2024-11-06 19:55:48,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21343 states, 21342 states have (on average 1.073751288539031) internal successors, (22916), 21342 states have internal predecessors, (22916), 0 states have call successors, (0), 0 states 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:55:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21343 states to 21343 states and 22916 transitions. [2024-11-06 19:55:48,193 INFO L78 Accepts]: Start accepts. Automaton has 21343 states and 22916 transitions. Word has length 488 [2024-11-06 19:55:48,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:48,193 INFO L471 AbstractCegarLoop]: Abstraction has 21343 states and 22916 transitions. [2024-11-06 19:55:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 83.44444444444444) internal successors, (751), 8 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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:55:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 21343 states and 22916 transitions. [2024-11-06 19:55:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2024-11-06 19:55:48,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:48,196 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:48,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-06 19:55:48,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:48,398 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:48,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:48,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1193169409, now seen corresponding path program 1 times [2024-11-06 19:55:48,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:48,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401035593] [2024-11-06 19:55:48,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:48,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:48,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 77 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:48,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401035593] [2024-11-06 19:55:48,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401035593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:48,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845979723] [2024-11-06 19:55:48,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:48,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:48,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:48,929 INFO L229 MonitoredProcess]: Starting monitored process 5 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:55:48,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 19:55:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:49,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 19:55:49,102 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 77 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:49,616 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:55:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845979723] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:50,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 19:55:50,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2024-11-06 19:55:50,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667766482] [2024-11-06 19:55:50,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:50,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 19:55:50,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:50,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 19:55:50,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-06 19:55:50,300 INFO L87 Difference]: Start difference. First operand 21343 states and 22916 transitions. Second operand has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:55:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:51,599 INFO L93 Difference]: Finished difference Result 45393 states and 48670 transitions. [2024-11-06 19:55:51,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:55:51,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 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 494 [2024-11-06 19:55:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:51,637 INFO L225 Difference]: With dead ends: 45393 [2024-11-06 19:55:51,638 INFO L226 Difference]: Without dead ends: 24052 [2024-11-06 19:55:51,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 991 GetRequests, 980 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2024-11-06 19:55:51,658 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 818 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:51,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 79 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:55:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24052 states. [2024-11-06 19:55:51,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24052 to 21044. [2024-11-06 19:55:51,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21044 states, 21043 states have (on average 1.0743240032314785) internal successors, (22607), 21043 states have internal predecessors, (22607), 0 states have call successors, (0), 0 states 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:55:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 22607 transitions. [2024-11-06 19:55:51,905 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 22607 transitions. Word has length 494 [2024-11-06 19:55:51,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:51,905 INFO L471 AbstractCegarLoop]: Abstraction has 21044 states and 22607 transitions. [2024-11-06 19:55:51,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 82.33333333333333) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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:55:51,906 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 22607 transitions. [2024-11-06 19:55:51,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-11-06 19:55:51,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:51,912 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:55:51,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 19:55:52,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-06 19:55:52,116 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:52,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:52,117 INFO L85 PathProgramCache]: Analyzing trace with hash -260242563, now seen corresponding path program 1 times [2024-11-06 19:55:52,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:52,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854311575] [2024-11-06 19:55:52,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:52,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:52,886 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 78 proven. 292 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-06 19:55:52,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:52,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854311575] [2024-11-06 19:55:52,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854311575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:52,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232483756] [2024-11-06 19:55:52,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:52,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:52,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:52,892 INFO L229 MonitoredProcess]: Starting monitored process 6 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:55:52,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 19:55:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:53,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:55:53,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-06 19:55:53,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:55:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232483756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:53,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:55:53,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:55:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830783002] [2024-11-06 19:55:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:53,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:55:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:55:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:55:53,099 INFO L87 Difference]: Start difference. First operand 21044 states and 22607 transitions. Second operand has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:55:53,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:53,772 INFO L93 Difference]: Finished difference Result 41784 states and 44894 transitions. [2024-11-06 19:55:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:55:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 582 [2024-11-06 19:55:53,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:53,798 INFO L225 Difference]: With dead ends: 41784 [2024-11-06 19:55:53,799 INFO L226 Difference]: Without dead ends: 20742 [2024-11-06 19:55:53,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 583 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:55:53,825 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 302 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:53,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 517 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:55:53,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2024-11-06 19:55:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2024-11-06 19:55:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20740 states, 20739 states have (on average 1.0436375910121027) internal successors, (21644), 20739 states have internal predecessors, (21644), 0 states have call successors, (0), 0 states 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:55:54,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 21644 transitions. [2024-11-06 19:55:54,125 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 21644 transitions. Word has length 582 [2024-11-06 19:55:54,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:54,126 INFO L471 AbstractCegarLoop]: Abstraction has 20740 states and 21644 transitions. [2024-11-06 19:55:54,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.33333333333333) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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:55:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 21644 transitions. [2024-11-06 19:55:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2024-11-06 19:55:54,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:54,134 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:55:54,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 19:55:54,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-06 19:55:54,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:54,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:54,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1767528899, now seen corresponding path program 1 times [2024-11-06 19:55:54,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:54,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806731502] [2024-11-06 19:55:54,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:54,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:54,789 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2024-11-06 19:55:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806731502] [2024-11-06 19:55:54,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806731502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:55:54,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:55:54,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:55:54,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189149419] [2024-11-06 19:55:54,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:55:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:55:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:55:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:55:54,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:55:54,791 INFO L87 Difference]: Start difference. First operand 20740 states and 21644 transitions. Second operand has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:55:56,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:55:56,861 INFO L93 Difference]: Finished difference Result 60101 states and 62753 transitions. [2024-11-06 19:55:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:55:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 667 [2024-11-06 19:55:56,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:55:56,894 INFO L225 Difference]: With dead ends: 60101 [2024-11-06 19:55:56,894 INFO L226 Difference]: Without dead ends: 39662 [2024-11-06 19:55:56,919 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:55:56,920 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 521 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 1537 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:55:56,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 165 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1537 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 19:55:56,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39662 states. [2024-11-06 19:55:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39662 to 35463. [2024-11-06 19:55:57,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35463 states, 35462 states have (on average 1.0431729738875415) internal successors, (36993), 35462 states have internal predecessors, (36993), 0 states have call successors, (0), 0 states 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:55:57,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35463 states to 35463 states and 36993 transitions. [2024-11-06 19:55:57,288 INFO L78 Accepts]: Start accepts. Automaton has 35463 states and 36993 transitions. Word has length 667 [2024-11-06 19:55:57,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:55:57,288 INFO L471 AbstractCegarLoop]: Abstraction has 35463 states and 36993 transitions. [2024-11-06 19:55:57,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.75) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states 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:55:57,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35463 states and 36993 transitions. [2024-11-06 19:55:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2024-11-06 19:55:57,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:55:57,371 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:55:57,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:55:57,371 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:55:57,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:55:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -293463254, now seen corresponding path program 1 times [2024-11-06 19:55:57,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:55:57,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129687723] [2024-11-06 19:55:57,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:57,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:55:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:58,162 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 77 proven. 464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:58,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:55:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129687723] [2024-11-06 19:55:58,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129687723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:55:58,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187172534] [2024-11-06 19:55:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:55:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:55:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:55:58,165 INFO L229 MonitoredProcess]: Starting monitored process 7 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:55:58,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 19:55:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:55:58,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 19:55:58,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:55:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 26 proven. 515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:55:59,044 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:56:04,914 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_~a29~0 5))) (let ((.cse2 (forall ((v_~a29~0_914 Int)) (or (< (+ 134659 .cse1) v_~a29~0_914) (< (div (* 9 v_~a29~0_914) 10) 579723))))) (and (forall ((v_~a29~0_914 Int)) (let ((.cse0 (+ 134660 .cse1))) (or (< .cse0 v_~a29~0_914) (< (div (* 9 v_~a29~0_914) 10) 579723) (= v_~a29~0_914 .cse0)))) (or (< c_~a29~0 0) .cse2) (or (not (= (mod c_~a29~0 5) 0)) .cse2)))) is different from false [2024-11-06 19:56:22,221 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 239 not checked. [2024-11-06 19:56:22,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187172534] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 19:56:22,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 19:56:22,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-06 19:56:22,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811726662] [2024-11-06 19:56:22,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 19:56:22,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-06 19:56:22,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-06 19:56:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=84, Unknown=3, NotChecked=22, Total=182 [2024-11-06 19:56:22,225 INFO L87 Difference]: Start difference. First operand 35463 states and 36993 transitions. Second operand has 14 states, 14 states have (on average 143.21428571428572) internal successors, (2005), 13 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states 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:56:30,710 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_~a29~0 5))) (let ((.cse2 (forall ((v_~a29~0_914 Int)) (or (< (+ 134659 .cse1) v_~a29~0_914) (< (div (* 9 v_~a29~0_914) 10) 579723))))) (and (forall ((v_~a29~0_914 Int)) (let ((.cse0 (+ 134660 .cse1))) (or (< .cse0 v_~a29~0_914) (< (div (* 9 v_~a29~0_914) 10) 579723) (= v_~a29~0_914 .cse0)))) (or (< c_~a29~0 0) .cse2) (or (not (= (mod c_~a29~0 5) 0)) .cse2) (<= c_~a29~0 135549)))) is different from false [2024-11-06 19:56:31,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:31,169 INFO L93 Difference]: Finished difference Result 80318 states and 83947 transitions. [2024-11-06 19:56:31,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 19:56:31,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 143.21428571428572) internal successors, (2005), 13 states have internal predecessors, (2005), 0 states have call successors, (0), 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 669 [2024-11-06 19:56:31,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:31,285 INFO L225 Difference]: With dead ends: 80318 [2024-11-06 19:56:31,285 INFO L226 Difference]: Without dead ends: 46653 [2024-11-06 19:56:31,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1344 GetRequests, 1330 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=75, Invalid=85, Unknown=4, NotChecked=46, Total=210 [2024-11-06 19:56:31,299 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 1876 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 5870 mSolverCounterSat, 785 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1876 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 10824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 785 IncrementalHoareTripleChecker+Valid, 5870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4169 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:31,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1876 Valid, 268 Invalid, 10824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [785 Valid, 5870 Invalid, 0 Unknown, 4169 Unchecked, 4.4s Time] [2024-11-06 19:56:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46653 states. [2024-11-06 19:56:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46653 to 37086. [2024-11-06 19:56:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37086 states, 37085 states have (on average 1.0444923823648375) internal successors, (38735), 37085 states have internal predecessors, (38735), 0 states have call successors, (0), 0 states 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:56:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37086 states to 37086 states and 38735 transitions. [2024-11-06 19:56:32,110 INFO L78 Accepts]: Start accepts. Automaton has 37086 states and 38735 transitions. Word has length 669 [2024-11-06 19:56:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:32,112 INFO L471 AbstractCegarLoop]: Abstraction has 37086 states and 38735 transitions. [2024-11-06 19:56:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 143.21428571428572) internal successors, (2005), 13 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states 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:56:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states and 38735 transitions. [2024-11-06 19:56:32,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2024-11-06 19:56:32,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:32,125 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:32,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-06 19:56:32,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-06 19:56:32,326 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:32,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:32,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1425294571, now seen corresponding path program 1 times [2024-11-06 19:56:32,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:32,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403282865] [2024-11-06 19:56:32,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:32,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-11-06 19:56:32,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:32,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403282865] [2024-11-06 19:56:32,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403282865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:32,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75201740] [2024-11-06 19:56:32,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:32,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:32,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:32,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:32,690 INFO L87 Difference]: Start difference. First operand 37086 states and 38735 transitions. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:56:33,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:33,872 INFO L93 Difference]: Finished difference Result 84033 states and 87859 transitions. [2024-11-06 19:56:33,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:33,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 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 682 [2024-11-06 19:56:33,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:33,943 INFO L225 Difference]: With dead ends: 84033 [2024-11-06 19:56:33,943 INFO L226 Difference]: Without dead ends: 49044 [2024-11-06 19:56:33,966 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:56:33,966 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 280 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:33,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 157 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:56:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49044 states. [2024-11-06 19:56:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49044 to 43660. [2024-11-06 19:56:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43660 states, 43659 states have (on average 1.0408621361002313) internal successors, (45443), 43659 states have internal predecessors, (45443), 0 states have call successors, (0), 0 states 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:56:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43660 states to 43660 states and 45443 transitions. [2024-11-06 19:56:34,714 INFO L78 Accepts]: Start accepts. Automaton has 43660 states and 45443 transitions. Word has length 682 [2024-11-06 19:56:34,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:34,715 INFO L471 AbstractCegarLoop]: Abstraction has 43660 states and 45443 transitions. [2024-11-06 19:56:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:56:34,715 INFO L276 IsEmpty]: Start isEmpty. Operand 43660 states and 45443 transitions. [2024-11-06 19:56:34,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2024-11-06 19:56:34,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:34,731 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:34,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 19:56:34,732 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:34,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash -940859142, now seen corresponding path program 1 times [2024-11-06 19:56:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:34,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738316876] [2024-11-06 19:56:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:34,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-06 19:56:34,865 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.