./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label59.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/Problem11_label59.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', 'b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1'] 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/Problem11_label59.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 b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:40:07,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:40:07,989 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:40:07,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:40:07,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:40:08,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:40:08,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:40:08,025 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:40:08,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:40:08,026 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:40:08,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:40:08,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:40:08,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:40:08,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:40:08,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:40:08,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:40:08,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:40:08,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:40:08,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:40:08,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:40:08,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:40:08,030 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:40:08,030 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 -> b318f94936d789f3e225c0b031e22ed136ba6b0572610da57c85f0ad4ebaa0a1 [2024-11-06 19:40:08,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:40:08,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:40:08,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:40:08,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:40:08,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:40:08,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2024-11-06 19:40:09,573 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:40:09,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:40:09,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label59.c [2024-11-06 19:40:09,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b1432e73/4ddf8ca1fb594cb0998ba46101e3df57/FLAG4f434260a [2024-11-06 19:40:09,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7b1432e73/4ddf8ca1fb594cb0998ba46101e3df57 [2024-11-06 19:40:09,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:40:09,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:40:09,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:40:09,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:40:09,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:40:09,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:40:09" (1/1) ... [2024-11-06 19:40:09,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53548578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:09, skipping insertion in model container [2024-11-06 19:40:09,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:40:09" (1/1) ... [2024-11-06 19:40:09,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:40:10,151 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/Problem11_label59.c[8515,8528] [2024-11-06 19:40:10,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:40:10,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:40:10,341 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/Problem11_label59.c[8515,8528] [2024-11-06 19:40:10,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:40:10,437 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:40:10,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10 WrapperNode [2024-11-06 19:40:10,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:40:10,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:40:10,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:40:10,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:40:10,444 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:40:10" (1/1) ... [2024-11-06 19:40:10,475 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:40:10" (1/1) ... [2024-11-06 19:40:10,570 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:40:10,570 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:40:10,571 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:40:10,571 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:40:10,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:40:10,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,659 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:40:10,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,695 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,710 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:40:10,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:40:10,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:40:10,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:40:10,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (1/1) ... [2024-11-06 19:40:10,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:40:10,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:10,798 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:40:10,801 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:40:10,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:40:10,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:40:10,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:40:10,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:40:10,900 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:40:10,902 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:40:12,486 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:40:12,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:40:12,506 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:40:12,506 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:40:12,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:12 BoogieIcfgContainer [2024-11-06 19:40:12,507 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:40:12,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:40:12,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:40:12,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:40:12,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:40:09" (1/3) ... [2024-11-06 19:40:12,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef33560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:40:12, skipping insertion in model container [2024-11-06 19:40:12,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:10" (2/3) ... [2024-11-06 19:40:12,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ef33560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:40:12, skipping insertion in model container [2024-11-06 19:40:12,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:12" (3/3) ... [2024-11-06 19:40:12,519 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label59.c [2024-11-06 19:40:12,531 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:40:12,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:40:12,596 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:40:12,605 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;@78dcfb57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:40:12,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:40:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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:40:12,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-06 19:40:12,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:12,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:12,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:12,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash 118092897, now seen corresponding path program 1 times [2024-11-06 19:40:12,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:12,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894186328] [2024-11-06 19:40:12,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:13,069 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:40:13,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:13,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894186328] [2024-11-06 19:40:13,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894186328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:13,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:13,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:40:13,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199542565] [2024-11-06 19:40:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:13,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:13,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:13,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:13,098 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:40:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:14,324 INFO L93 Difference]: Finished difference Result 763 states and 1352 transitions. [2024-11-06 19:40:14,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:14,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2024-11-06 19:40:14,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:14,337 INFO L225 Difference]: With dead ends: 763 [2024-11-06 19:40:14,339 INFO L226 Difference]: Without dead ends: 416 [2024-11-06 19:40:14,343 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:40:14,345 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 214 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:14,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 89 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:40:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-06 19:40:14,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-06 19:40:14,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 1.6142506142506143) internal successors, (657), 407 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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:40:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 657 transitions. [2024-11-06 19:40:14,397 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 657 transitions. Word has length 59 [2024-11-06 19:40:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:14,398 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 657 transitions. [2024-11-06 19:40:14,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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:40:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 657 transitions. [2024-11-06 19:40:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-06 19:40:14,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:14,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:14,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:40:14,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:14,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:14,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1894877470, now seen corresponding path program 1 times [2024-11-06 19:40:14,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:14,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981383988] [2024-11-06 19:40:14,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:14,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:14,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:14,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981383988] [2024-11-06 19:40:14,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981383988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:14,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:14,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:40:14,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813688419] [2024-11-06 19:40:14,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:14,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:14,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:14,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:14,722 INFO L87 Difference]: Start difference. First operand 408 states and 657 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:15,560 INFO L93 Difference]: Finished difference Result 1193 states and 1931 transitions. [2024-11-06 19:40:15,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:15,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-11-06 19:40:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:15,569 INFO L225 Difference]: With dead ends: 1193 [2024-11-06 19:40:15,569 INFO L226 Difference]: Without dead ends: 787 [2024-11-06 19:40:15,570 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:40:15,571 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 143 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:15,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 153 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:40:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-06 19:40:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 783. [2024-11-06 19:40:15,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 1.4398976982097187) internal successors, (1126), 782 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states 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:40:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1126 transitions. [2024-11-06 19:40:15,609 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1126 transitions. Word has length 124 [2024-11-06 19:40:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:15,609 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1126 transitions. [2024-11-06 19:40:15,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:15,610 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1126 transitions. [2024-11-06 19:40:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-06 19:40:15,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:15,612 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:15,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:40:15,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:15,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:15,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1494454920, now seen corresponding path program 1 times [2024-11-06 19:40:15,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:15,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820731593] [2024-11-06 19:40:15,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:15,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:15,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:15,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820731593] [2024-11-06 19:40:15,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820731593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:15,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:15,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:40:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291439905] [2024-11-06 19:40:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:15,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:15,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:15,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:15,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:15,871 INFO L87 Difference]: Start difference. First operand 783 states and 1126 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:40:16,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:16,547 INFO L93 Difference]: Finished difference Result 1948 states and 2803 transitions. [2024-11-06 19:40:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:16,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2024-11-06 19:40:16,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:16,552 INFO L225 Difference]: With dead ends: 1948 [2024-11-06 19:40:16,553 INFO L226 Difference]: Without dead ends: 1167 [2024-11-06 19:40:16,554 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:40:16,555 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:16,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 116 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:40:16,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2024-11-06 19:40:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1154. [2024-11-06 19:40:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1153 states have (on average 1.3399826539462272) internal successors, (1545), 1153 states have internal predecessors, (1545), 0 states have call successors, (0), 0 states 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:40:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1545 transitions. [2024-11-06 19:40:16,597 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1545 transitions. Word has length 127 [2024-11-06 19:40:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:16,597 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1545 transitions. [2024-11-06 19:40:16,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states 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:40:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1545 transitions. [2024-11-06 19:40:16,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-06 19:40:16,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:16,601 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:16,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:40:16,601 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:16,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1334026776, now seen corresponding path program 1 times [2024-11-06 19:40:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:16,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868562176] [2024-11-06 19:40:16,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:16,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:16,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868562176] [2024-11-06 19:40:16,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868562176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:40:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24270457] [2024-11-06 19:40:16,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:16,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:16,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:16,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:16,955 INFO L87 Difference]: Start difference. First operand 1154 states and 1545 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:17,741 INFO L93 Difference]: Finished difference Result 2676 states and 3531 transitions. [2024-11-06 19:40:17,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2024-11-06 19:40:17,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:17,748 INFO L225 Difference]: With dead ends: 2676 [2024-11-06 19:40:17,749 INFO L226 Difference]: Without dead ends: 1524 [2024-11-06 19:40:17,750 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:40:17,752 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:17,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 189 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1524 states. [2024-11-06 19:40:17,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1524 to 1523. [2024-11-06 19:40:17,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1523 states, 1522 states have (on average 1.269382391590013) internal successors, (1932), 1522 states have internal predecessors, (1932), 0 states have call successors, (0), 0 states 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:40:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1932 transitions. [2024-11-06 19:40:17,785 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1932 transitions. Word has length 128 [2024-11-06 19:40:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 1523 states and 1932 transitions. [2024-11-06 19:40:17,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1932 transitions. [2024-11-06 19:40:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-06 19:40:17,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:17,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:17,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:40:17,791 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:17,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1749899371, now seen corresponding path program 1 times [2024-11-06 19:40:17,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:17,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211620435] [2024-11-06 19:40:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:17,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:17,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211620435] [2024-11-06 19:40:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211620435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:40:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473337621] [2024-11-06 19:40:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:17,958 INFO L87 Difference]: Start difference. First operand 1523 states and 1932 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:40:18,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:18,706 INFO L93 Difference]: Finished difference Result 3968 states and 5154 transitions. [2024-11-06 19:40:18,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:18,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 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 186 [2024-11-06 19:40:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:18,717 INFO L225 Difference]: With dead ends: 3968 [2024-11-06 19:40:18,717 INFO L226 Difference]: Without dead ends: 2631 [2024-11-06 19:40:18,719 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:40:18,721 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 115 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:18,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 154 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2024-11-06 19:40:18,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2631. [2024-11-06 19:40:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.2133079847908745) internal successors, (3191), 2630 states have internal predecessors, (3191), 0 states have call successors, (0), 0 states 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:40:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3191 transitions. [2024-11-06 19:40:18,772 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3191 transitions. Word has length 186 [2024-11-06 19:40:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:18,772 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3191 transitions. [2024-11-06 19:40:18,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:40:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3191 transitions. [2024-11-06 19:40:18,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-06 19:40:18,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:18,777 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:18,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:40:18,777 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:18,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:18,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1893767947, now seen corresponding path program 1 times [2024-11-06 19:40:18,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:18,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918495582] [2024-11-06 19:40:18,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:18,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:19,225 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:19,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:19,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918495582] [2024-11-06 19:40:19,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918495582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:19,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:19,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:19,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685584569] [2024-11-06 19:40:19,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:19,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:19,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:19,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:40:19,228 INFO L87 Difference]: Start difference. First operand 2631 states and 3191 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:40:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:20,662 INFO L93 Difference]: Finished difference Result 7118 states and 8850 transitions. [2024-11-06 19:40:20,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:20,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 202 [2024-11-06 19:40:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:20,681 INFO L225 Difference]: With dead ends: 7118 [2024-11-06 19:40:20,682 INFO L226 Difference]: Without dead ends: 4673 [2024-11-06 19:40:20,685 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:40:20,687 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 245 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:20,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 79 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 19:40:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4673 states. [2024-11-06 19:40:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4673 to 4295. [2024-11-06 19:40:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4295 states, 4294 states have (on average 1.231020027945971) internal successors, (5286), 4294 states have internal predecessors, (5286), 0 states have call successors, (0), 0 states 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:40:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4295 states to 4295 states and 5286 transitions. [2024-11-06 19:40:20,775 INFO L78 Accepts]: Start accepts. Automaton has 4295 states and 5286 transitions. Word has length 202 [2024-11-06 19:40:20,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:20,775 INFO L471 AbstractCegarLoop]: Abstraction has 4295 states and 5286 transitions. [2024-11-06 19:40:20,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 0 states 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:40:20,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4295 states and 5286 transitions. [2024-11-06 19:40:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-06 19:40:20,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:20,781 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:40:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:40:20,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:20,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -878115989, now seen corresponding path program 1 times [2024-11-06 19:40:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928633373] [2024-11-06 19:40:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:21,006 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:21,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:21,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928633373] [2024-11-06 19:40:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928633373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:21,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:21,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462371647] [2024-11-06 19:40:21,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:21,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:21,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:21,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:21,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:21,008 INFO L87 Difference]: Start difference. First operand 4295 states and 5286 transitions. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:40:21,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:21,802 INFO L93 Difference]: Finished difference Result 9519 states and 11889 transitions. [2024-11-06 19:40:21,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:21,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 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 239 [2024-11-06 19:40:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:21,822 INFO L225 Difference]: With dead ends: 9519 [2024-11-06 19:40:21,822 INFO L226 Difference]: Without dead ends: 5594 [2024-11-06 19:40:21,827 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:40:21,828 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:21,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 331 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2024-11-06 19:40:21,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5399. [2024-11-06 19:40:21,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5399 states, 5398 states have (on average 1.2182289736939607) internal successors, (6576), 5398 states have internal predecessors, (6576), 0 states have call successors, (0), 0 states 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:40:21,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 6576 transitions. [2024-11-06 19:40:21,932 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 6576 transitions. Word has length 239 [2024-11-06 19:40:21,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:21,933 INFO L471 AbstractCegarLoop]: Abstraction has 5399 states and 6576 transitions. [2024-11-06 19:40:21,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states 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:40:21,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 6576 transitions. [2024-11-06 19:40:21,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-06 19:40:21,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:21,936 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:40:21,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:40:21,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:21,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:21,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1869280923, now seen corresponding path program 1 times [2024-11-06 19:40:21,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:21,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4455831] [2024-11-06 19:40:21,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:22,213 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:40:22,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:22,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4455831] [2024-11-06 19:40:22,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4455831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:22,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:22,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:22,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944415021] [2024-11-06 19:40:22,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:22,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:22,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:22,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:22,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:22,216 INFO L87 Difference]: Start difference. First operand 5399 states and 6576 transitions. Second operand has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:40:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:23,033 INFO L93 Difference]: Finished difference Result 14317 states and 17683 transitions. [2024-11-06 19:40:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:23,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 240 [2024-11-06 19:40:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:23,061 INFO L225 Difference]: With dead ends: 14317 [2024-11-06 19:40:23,062 INFO L226 Difference]: Without dead ends: 9288 [2024-11-06 19:40:23,069 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:40:23,070 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 167 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:23,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 331 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9288 states. [2024-11-06 19:40:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9288 to 8184. [2024-11-06 19:40:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8184 states, 8183 states have (on average 1.2134913845777833) internal successors, (9930), 8183 states have internal predecessors, (9930), 0 states have call successors, (0), 0 states 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:40:23,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8184 states to 8184 states and 9930 transitions. [2024-11-06 19:40:23,230 INFO L78 Accepts]: Start accepts. Automaton has 8184 states and 9930 transitions. Word has length 240 [2024-11-06 19:40:23,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:23,231 INFO L471 AbstractCegarLoop]: Abstraction has 8184 states and 9930 transitions. [2024-11-06 19:40:23,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.666666666666664) internal successors, (173), 3 states have internal predecessors, (173), 0 states have call successors, (0), 0 states 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:40:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8184 states and 9930 transitions. [2024-11-06 19:40:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-06 19:40:23,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:23,235 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:40:23,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:40:23,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:23,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2080681397, now seen corresponding path program 1 times [2024-11-06 19:40:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145012283] [2024-11-06 19:40:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145012283] [2024-11-06 19:40:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145012283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367964704] [2024-11-06 19:40:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:40:23,621 INFO L87 Difference]: Start difference. First operand 8184 states and 9930 transitions. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:40:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:24,966 INFO L93 Difference]: Finished difference Result 17850 states and 21799 transitions. [2024-11-06 19:40:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:40:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2024-11-06 19:40:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:25,004 INFO L225 Difference]: With dead ends: 17850 [2024-11-06 19:40:25,004 INFO L226 Difference]: Without dead ends: 10036 [2024-11-06 19:40:25,013 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:40:25,015 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 230 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:25,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 144 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:40:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10036 states. [2024-11-06 19:40:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10036 to 9658. [2024-11-06 19:40:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9658 states, 9657 states have (on average 1.2026509267888579) internal successors, (11614), 9657 states have internal predecessors, (11614), 0 states have call successors, (0), 0 states 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:40:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9658 states to 9658 states and 11614 transitions. [2024-11-06 19:40:25,173 INFO L78 Accepts]: Start accepts. Automaton has 9658 states and 11614 transitions. Word has length 261 [2024-11-06 19:40:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:25,173 INFO L471 AbstractCegarLoop]: Abstraction has 9658 states and 11614 transitions. [2024-11-06 19:40:25,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:40:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 9658 states and 11614 transitions. [2024-11-06 19:40:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-06 19:40:25,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:25,180 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:40:25,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:40:25,181 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:25,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2113401050, now seen corresponding path program 1 times [2024-11-06 19:40:25,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:25,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235404725] [2024-11-06 19:40:25,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:25,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:25,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235404725] [2024-11-06 19:40:25,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235404725] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:25,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085444950] [2024-11-06 19:40:25,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:25,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:40:25,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:25,836 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:40:25,839 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:40:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:25,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 19:40:26,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:40:26,275 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 128 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:40:26,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 19:40:26,434 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-06 19:40:26,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085444950] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 19:40:26,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 19:40:26,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 5 [2024-11-06 19:40:26,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727576494] [2024-11-06 19:40:26,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:26,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:26,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:26,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:26,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:40:26,437 INFO L87 Difference]: Start difference. First operand 9658 states and 11614 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:40:27,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:27,340 INFO L93 Difference]: Finished difference Result 18385 states and 22011 transitions. [2024-11-06 19:40:27,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:27,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 313 [2024-11-06 19:40:27,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:27,356 INFO L225 Difference]: With dead ends: 18385 [2024-11-06 19:40:27,357 INFO L226 Difference]: Without dead ends: 9097 [2024-11-06 19:40:27,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 625 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:40:27,366 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 161 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:27,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 308 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:40:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9097 states. [2024-11-06 19:40:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9097 to 8358. [2024-11-06 19:40:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8358 states, 8357 states have (on average 1.1808065095129832) internal successors, (9868), 8357 states have internal predecessors, (9868), 0 states have call successors, (0), 0 states 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:40:27,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8358 states to 8358 states and 9868 transitions. [2024-11-06 19:40:27,475 INFO L78 Accepts]: Start accepts. Automaton has 8358 states and 9868 transitions. Word has length 313 [2024-11-06 19:40:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:27,476 INFO L471 AbstractCegarLoop]: Abstraction has 8358 states and 9868 transitions. [2024-11-06 19:40:27,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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:40:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 8358 states and 9868 transitions. [2024-11-06 19:40:27,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2024-11-06 19:40:27,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:27,488 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:27,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 19:40:27,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-06 19:40:27,688 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:27,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:27,689 INFO L85 PathProgramCache]: Analyzing trace with hash 658760884, now seen corresponding path program 1 times [2024-11-06 19:40:27,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:27,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247564712] [2024-11-06 19:40:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:27,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:27,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-06 19:40:27,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:27,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247564712] [2024-11-06 19:40:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247564712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:27,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624570425] [2024-11-06 19:40:27,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:27,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:27,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:27,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:27,998 INFO L87 Difference]: Start difference. First operand 8358 states and 9868 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:40:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:28,764 INFO L93 Difference]: Finished difference Result 17639 states and 20898 transitions. [2024-11-06 19:40:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 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 381 [2024-11-06 19:40:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:28,781 INFO L225 Difference]: With dead ends: 17639 [2024-11-06 19:40:28,781 INFO L226 Difference]: Without dead ends: 9467 [2024-11-06 19:40:28,790 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:40:28,791 INFO L432 NwaCegarLoop]: 339 mSDtfsCounter, 107 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:28,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 361 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9467 states. [2024-11-06 19:40:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9467 to 9278. [2024-11-06 19:40:28,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9278 states, 9277 states have (on average 1.1745176242319715) internal successors, (10896), 9277 states have internal predecessors, (10896), 0 states have call successors, (0), 0 states 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:40:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 10896 transitions. [2024-11-06 19:40:28,977 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 10896 transitions. Word has length 381 [2024-11-06 19:40:28,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:28,977 INFO L471 AbstractCegarLoop]: Abstraction has 9278 states and 10896 transitions. [2024-11-06 19:40:28,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states 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:40:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 10896 transitions. [2024-11-06 19:40:28,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2024-11-06 19:40:28,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:28,992 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-06 19:40:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:40:28,992 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:28,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:28,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1793054198, now seen corresponding path program 1 times [2024-11-06 19:40:28,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:28,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825071845] [2024-11-06 19:40:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:28,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2024-11-06 19:40:29,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:29,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825071845] [2024-11-06 19:40:29,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825071845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:29,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:29,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:29,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890457757] [2024-11-06 19:40:29,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:29,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:29,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:29,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:29,284 INFO L87 Difference]: Start difference. First operand 9278 states and 10896 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:40:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:30,074 INFO L93 Difference]: Finished difference Result 19840 states and 23280 transitions. [2024-11-06 19:40:30,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:30,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 386 [2024-11-06 19:40:30,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:30,096 INFO L225 Difference]: With dead ends: 19840 [2024-11-06 19:40:30,096 INFO L226 Difference]: Without dead ends: 10934 [2024-11-06 19:40:30,105 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:40:30,106 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 162 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:30,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 317 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:40:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10934 states. [2024-11-06 19:40:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10934 to 7785. [2024-11-06 19:40:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7785 states, 7784 states have (on average 1.1379753340184995) internal successors, (8858), 7784 states have internal predecessors, (8858), 0 states have call successors, (0), 0 states 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:40:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7785 states to 7785 states and 8858 transitions. [2024-11-06 19:40:30,230 INFO L78 Accepts]: Start accepts. Automaton has 7785 states and 8858 transitions. Word has length 386 [2024-11-06 19:40:30,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:30,231 INFO L471 AbstractCegarLoop]: Abstraction has 7785 states and 8858 transitions. [2024-11-06 19:40:30,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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:40:30,231 INFO L276 IsEmpty]: Start isEmpty. Operand 7785 states and 8858 transitions. [2024-11-06 19:40:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2024-11-06 19:40:30,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:30,243 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-06 19:40:30,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:40:30,244 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:30,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:30,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1378379559, now seen corresponding path program 1 times [2024-11-06 19:40:30,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:30,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470479797] [2024-11-06 19:40:30,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:30,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:30,548 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 387 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-06 19:40:30,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:30,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470479797] [2024-11-06 19:40:30,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470479797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:30,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:30,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:30,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122698991] [2024-11-06 19:40:30,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:30,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:30,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:30,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:30,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:30,551 INFO L87 Difference]: Start difference. First operand 7785 states and 8858 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:40:31,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:31,247 INFO L93 Difference]: Finished difference Result 17417 states and 19899 transitions. [2024-11-06 19:40:31,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:31,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 401 [2024-11-06 19:40:31,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:31,266 INFO L225 Difference]: With dead ends: 17417 [2024-11-06 19:40:31,266 INFO L226 Difference]: Without dead ends: 10004 [2024-11-06 19:40:31,274 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:40:31,275 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:31,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 132 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:40:31,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10004 states. [2024-11-06 19:40:31,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10004 to 9634. [2024-11-06 19:40:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9634 states, 9633 states have (on average 1.1337070486868057) internal successors, (10921), 9633 states have internal predecessors, (10921), 0 states have call successors, (0), 0 states 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:40:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9634 states to 9634 states and 10921 transitions. [2024-11-06 19:40:31,382 INFO L78 Accepts]: Start accepts. Automaton has 9634 states and 10921 transitions. Word has length 401 [2024-11-06 19:40:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:31,382 INFO L471 AbstractCegarLoop]: Abstraction has 9634 states and 10921 transitions. [2024-11-06 19:40:31,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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:40:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 9634 states and 10921 transitions. [2024-11-06 19:40:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2024-11-06 19:40:31,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:31,395 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-06 19:40:31,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:40:31,396 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:31,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:31,396 INFO L85 PathProgramCache]: Analyzing trace with hash -384632590, now seen corresponding path program 1 times [2024-11-06 19:40:31,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993159046] [2024-11-06 19:40:31,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:31,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-06 19:40:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993159046] [2024-11-06 19:40:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993159046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:31,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316782260] [2024-11-06 19:40:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:31,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:40:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:40:31,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:40:31,958 INFO L87 Difference]: Start difference. First operand 9634 states and 10921 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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:40:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:40:32,616 INFO L93 Difference]: Finished difference Result 20182 states and 22883 transitions. [2024-11-06 19:40:32,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:40:32,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 411 [2024-11-06 19:40:32,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:40:32,617 INFO L225 Difference]: With dead ends: 20182 [2024-11-06 19:40:32,618 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:40:32,628 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:40:32,630 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 164 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:40:32,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 312 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:40:32,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:40:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:40:32,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:40:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:40:32,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 411 [2024-11-06 19:40:32,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:40:32,633 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:40:32,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states 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:40:32,633 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:40:32,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:40:32,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:40:32,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:40:32,640 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:40:32,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:40:33,584 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:40:33,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:40:33 BoogieIcfgContainer [2024-11-06 19:40:33,600 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:40:33,601 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:40:33,601 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:40:33,601 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:40:33,601 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:12" (3/4) ... [2024-11-06 19:40:33,603 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:40:33,628 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:40:33,630 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:40:33,631 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:40:33,632 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:40:33,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:40:33,780 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:40:33,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:40:33,781 INFO L158 Benchmark]: Toolchain (without parser) took 23874.61ms. Allocated memory was 117.4MB in the beginning and 637.5MB in the end (delta: 520.1MB). Free memory was 88.6MB in the beginning and 501.4MB in the end (delta: -412.7MB). Peak memory consumption was 105.5MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,782 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:40:33,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 530.08ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 45.6MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 131.94ms. Allocated memory is still 117.4MB. Free memory was 45.6MB in the beginning and 73.8MB in the end (delta: -28.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,783 INFO L158 Benchmark]: Boogie Preprocessor took 191.50ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 49.0MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,783 INFO L158 Benchmark]: RCFGBuilder took 1743.21ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 49.0MB in the beginning and 89.3MB in the end (delta: -40.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,784 INFO L158 Benchmark]: TraceAbstraction took 21089.12ms. Allocated memory was 151.0MB in the beginning and 637.5MB in the end (delta: 486.5MB). Free memory was 88.0MB in the beginning and 513.8MB in the end (delta: -425.7MB). Peak memory consumption was 375.8MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,784 INFO L158 Benchmark]: Witness Printer took 180.11ms. Allocated memory is still 637.5MB. Free memory was 513.8MB in the beginning and 501.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 19:40:33,786 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 530.08ms. Allocated memory is still 117.4MB. Free memory was 88.5MB in the beginning and 45.6MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 131.94ms. Allocated memory is still 117.4MB. Free memory was 45.6MB in the beginning and 73.8MB in the end (delta: -28.1MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 191.50ms. Allocated memory is still 117.4MB. Free memory was 73.8MB in the beginning and 49.0MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1743.21ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 49.0MB in the beginning and 89.3MB in the end (delta: -40.3MB). Peak memory consumption was 55.2MB. Max. memory is 16.1GB. * TraceAbstraction took 21089.12ms. Allocated memory was 151.0MB in the beginning and 637.5MB in the end (delta: 486.5MB). Free memory was 88.0MB in the beginning and 513.8MB in the end (delta: -425.7MB). Peak memory consumption was 375.8MB. Max. memory is 16.1GB. * Witness Printer took 180.11ms. Allocated memory is still 637.5MB. Free memory was 513.8MB in the beginning and 501.4MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 193]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 14, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2249 SdHoareTripleChecker+Valid, 11.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2249 mSDsluCounter, 3016 SdHoareTripleChecker+Invalid, 9.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 318 mSDsCounter, 1861 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8798 IncrementalHoareTripleChecker+Invalid, 10659 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1861 mSolverCounterUnsat, 2698 mSDtfsCounter, 8798 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 644 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9658occurred in iteration=9, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 6528 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 3771 NumberOfCodeBlocks, 3771 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 4068 ConstructedInterpolants, 0 QuantifiedInterpolants, 7382 SizeOfPredicates, 1 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 3066/3180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((a23 <= 266) && (a4 == 1)) || ((a25 == 12) && (141 <= a29))) || ((260 <= a29) && (a23 <= 137))) || ((141 <= a29) && (a4 == 1))) || ((a25 == 10) && (a29 <= 130))) || ((a23 <= 138) && (a29 <= 220))) || ((a25 == 12) && (a29 <= 130))) || ((10 <= a25) && (a23 <= 138))) || ((10 <= a25) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:40:33,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE