./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem12_label53.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', '053df9010d5712277310e4ef905c5ec88d30ed5d93ad0429bc9d2f63ecfb87d7'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem12_label53.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 053df9010d5712277310e4ef905c5ec88d30ed5d93ad0429bc9d2f63ecfb87d7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:45:10,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:45:10,323 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:45:10,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:45:10,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:45:10,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:45:10,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:45:10,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:45:10,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:45:10,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:45:10,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:45:10,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:45:10,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:45:10,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:45:10,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:45:10,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:45:10,347 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:45:10,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:45:10,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:45:10,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:45:10,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:45:10,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:45:10,350 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:45:10,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:45:10,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:10,350 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:45:10,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:45:10,351 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 -> 053df9010d5712277310e4ef905c5ec88d30ed5d93ad0429bc9d2f63ecfb87d7 [2024-11-06 19:45:10,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:45:10,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:45:10,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:45:10,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:45:10,548 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:45:10,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label53.c [2024-11-06 19:45:11,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:45:12,063 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:45:12,064 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label53.c [2024-11-06 19:45:12,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59e146600/14974034c2884c6d9706cd4196c27219/FLAGf796a3bce [2024-11-06 19:45:12,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/59e146600/14974034c2884c6d9706cd4196c27219 [2024-11-06 19:45:12,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:45:12,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:45:12,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:12,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:45:12,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:45:12,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:12" (1/1) ... [2024-11-06 19:45:12,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cb76cc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:12, skipping insertion in model container [2024-11-06 19:45:12,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:45:12" (1/1) ... [2024-11-06 19:45:12,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:45:12,417 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label53.c[4245,4258] [2024-11-06 19:45:12,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:12,851 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:45:12,864 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label53.c[4245,4258] [2024-11-06 19:45:13,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:45:13,101 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:45:13,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13 WrapperNode [2024-11-06 19:45:13,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:45:13,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:13,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:45:13,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:45:13,108 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:45:13" (1/1) ... [2024-11-06 19:45:13,137 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:45:13" (1/1) ... [2024-11-06 19:45:13,417 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:45:13,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:45:13,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:45:13,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:45:13,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:45:13,428 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,617 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:45:13,618 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,618 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:45:13,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:45:13,810 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:45:13,810 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:45:13,811 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (1/1) ... [2024-11-06 19:45:13,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:45:13,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:13,835 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:45:13,839 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:45:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:45:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:45:13,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:45:13,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:45:13,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:45:13,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:45:16,984 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:45:16,984 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:45:17,014 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:45:17,014 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:45:17,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:17 BoogieIcfgContainer [2024-11-06 19:45:17,015 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:45:17,016 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:45:17,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:45:17,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:45:17,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:45:12" (1/3) ... [2024-11-06 19:45:17,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daadc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:17, skipping insertion in model container [2024-11-06 19:45:17,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:45:13" (2/3) ... [2024-11-06 19:45:17,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2daadc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:45:17, skipping insertion in model container [2024-11-06 19:45:17,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:17" (3/3) ... [2024-11-06 19:45:17,026 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label53.c [2024-11-06 19:45:17,037 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:45:17,037 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:45:17,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:45:17,142 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;@ff683c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:45:17,143 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:45:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 19:45:17,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:17,160 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] [2024-11-06 19:45:17,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:17,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2024-11-06 19:45:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:17,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340253242] [2024-11-06 19:45:17,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:17,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:17,540 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:45:17,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:17,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340253242] [2024-11-06 19:45:17,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340253242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:17,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:17,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:17,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104837577] [2024-11-06 19:45:17,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:17,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:17,561 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:21,990 INFO L93 Difference]: Finished difference Result 3155 states and 6150 transitions. [2024-11-06 19:45:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 19:45:21,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-06 19:45:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:22,007 INFO L225 Difference]: With dead ends: 3155 [2024-11-06 19:45:22,007 INFO L226 Difference]: Without dead ends: 2265 [2024-11-06 19:45:22,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:22,013 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 2432 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 5453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:22,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 234 Invalid, 5453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1719 Valid, 3734 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-06 19:45:22,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2024-11-06 19:45:22,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 2257. [2024-11-06 19:45:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.5350177304964538) internal successors, (3463), 2256 states have internal predecessors, (3463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:22,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3463 transitions. [2024-11-06 19:45:22,093 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3463 transitions. Word has length 32 [2024-11-06 19:45:22,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:22,094 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3463 transitions. [2024-11-06 19:45:22,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:22,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3463 transitions. [2024-11-06 19:45:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-06 19:45:22,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:22,097 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:45:22,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:45:22,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:22,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:22,098 INFO L85 PathProgramCache]: Analyzing trace with hash -831855753, now seen corresponding path program 1 times [2024-11-06 19:45:22,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:22,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445013830] [2024-11-06 19:45:22,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:22,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:22,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445013830] [2024-11-06 19:45:22,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445013830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:22,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:22,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993546865] [2024-11-06 19:45:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:22,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:45:22,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:22,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:45:22,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:22,459 INFO L87 Difference]: Start difference. First operand 2257 states and 3463 transitions. Second operand has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:25,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:25,496 INFO L93 Difference]: Finished difference Result 6051 states and 9664 transitions. [2024-11-06 19:45:25,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:45:25,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2024-11-06 19:45:25,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:25,506 INFO L225 Difference]: With dead ends: 6051 [2024-11-06 19:45:25,506 INFO L226 Difference]: Without dead ends: 3759 [2024-11-06 19:45:25,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:45:25,509 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 702 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 3836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:25,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 708 Invalid, 3836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:45:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2024-11-06 19:45:25,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2024-11-06 19:45:25,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3408728046833422) internal successors, (5039), 3758 states have internal predecessors, (5039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:25,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5039 transitions. [2024-11-06 19:45:25,554 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5039 transitions. Word has length 172 [2024-11-06 19:45:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5039 transitions. [2024-11-06 19:45:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.0) internal successors, (172), 3 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5039 transitions. [2024-11-06 19:45:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-06 19:45:25,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:25,557 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:45:25,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:45:25,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:25,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1699477318, now seen corresponding path program 1 times [2024-11-06 19:45:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630397680] [2024-11-06 19:45:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:25,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:25,759 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:45:25,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:25,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630397680] [2024-11-06 19:45:25,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630397680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:25,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:25,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:45:25,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690176494] [2024-11-06 19:45:25,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:25,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:25,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:25,762 INFO L87 Difference]: Start difference. First operand 3759 states and 5039 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:27,830 INFO L93 Difference]: Finished difference Result 10520 states and 14356 transitions. [2024-11-06 19:45:27,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:27,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 242 [2024-11-06 19:45:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:27,845 INFO L225 Difference]: With dead ends: 10520 [2024-11-06 19:45:27,846 INFO L226 Difference]: Without dead ends: 6763 [2024-11-06 19:45:27,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:27,849 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 845 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 2834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 845 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:27,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 486 Invalid, 2834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [845 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 19:45:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6763 states. [2024-11-06 19:45:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6763 to 6012. [2024-11-06 19:45:27,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6012 states, 6011 states have (on average 1.2814839460988188) internal successors, (7703), 6011 states have internal predecessors, (7703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 7703 transitions. [2024-11-06 19:45:27,916 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 7703 transitions. Word has length 242 [2024-11-06 19:45:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:27,917 INFO L471 AbstractCegarLoop]: Abstraction has 6012 states and 7703 transitions. [2024-11-06 19:45:27,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 7703 transitions. [2024-11-06 19:45:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-06 19:45:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:27,923 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:45:27,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:45:27,923 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:27,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:27,924 INFO L85 PathProgramCache]: Analyzing trace with hash -12454335, now seen corresponding path program 1 times [2024-11-06 19:45:27,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:27,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001900881] [2024-11-06 19:45:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:27,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:28,233 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 59 proven. 54 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-06 19:45:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001900881] [2024-11-06 19:45:28,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001900881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:45:28,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965141002] [2024-11-06 19:45:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:28,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:28,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:28,237 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:45:28,238 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:45:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:28,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:45:28,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:45:28,450 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:45:28,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:45:28,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965141002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:45:28,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-06 19:45:28,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238206787] [2024-11-06 19:45:28,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:28,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:28,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:28,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:28,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:28,452 INFO L87 Difference]: Start difference. First operand 6012 states and 7703 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:30,412 INFO L93 Difference]: Finished difference Result 15026 states and 19934 transitions. [2024-11-06 19:45:30,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:30,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2024-11-06 19:45:30,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:30,430 INFO L225 Difference]: With dead ends: 15026 [2024-11-06 19:45:30,430 INFO L226 Difference]: Without dead ends: 9016 [2024-11-06 19:45:30,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 254 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:45:30,435 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 908 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 703 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 703 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:30,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 309 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [703 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 19:45:30,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9016 states. [2024-11-06 19:45:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9016 to 9016. [2024-11-06 19:45:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9016 states, 9015 states have (on average 1.2657792567942319) internal successors, (11411), 9015 states have internal predecessors, (11411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9016 states to 9016 states and 11411 transitions. [2024-11-06 19:45:30,532 INFO L78 Accepts]: Start accepts. Automaton has 9016 states and 11411 transitions. Word has length 255 [2024-11-06 19:45:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:30,532 INFO L471 AbstractCegarLoop]: Abstraction has 9016 states and 11411 transitions. [2024-11-06 19:45:30,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:30,532 INFO L276 IsEmpty]: Start isEmpty. Operand 9016 states and 11411 transitions. [2024-11-06 19:45:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-06 19:45:30,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:30,534 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:30,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:45:30,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:30,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:30,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -397969285, now seen corresponding path program 1 times [2024-11-06 19:45:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:30,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748338747] [2024-11-06 19:45:30,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-06 19:45:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748338747] [2024-11-06 19:45:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748338747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:31,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121829377] [2024-11-06 19:45:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:31,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:31,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:31,056 INFO L87 Difference]: Start difference. First operand 9016 states and 11411 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:33,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:33,318 INFO L93 Difference]: Finished difference Result 21785 states and 27827 transitions. [2024-11-06 19:45:33,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:33,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 272 [2024-11-06 19:45:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:33,339 INFO L225 Difference]: With dead ends: 21785 [2024-11-06 19:45:33,339 INFO L226 Difference]: Without dead ends: 12771 [2024-11-06 19:45:33,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:33,345 INFO L432 NwaCegarLoop]: 1208 mSDtfsCounter, 743 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1216 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:33,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1216 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:45:33,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12771 states. [2024-11-06 19:45:33,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12771 to 12771. [2024-11-06 19:45:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12771 states, 12770 states have (on average 1.183868441660141) internal successors, (15118), 12770 states have internal predecessors, (15118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12771 states to 12771 states and 15118 transitions. [2024-11-06 19:45:33,480 INFO L78 Accepts]: Start accepts. Automaton has 12771 states and 15118 transitions. Word has length 272 [2024-11-06 19:45:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:33,480 INFO L471 AbstractCegarLoop]: Abstraction has 12771 states and 15118 transitions. [2024-11-06 19:45:33,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:33,481 INFO L276 IsEmpty]: Start isEmpty. Operand 12771 states and 15118 transitions. [2024-11-06 19:45:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-06 19:45:33,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:33,484 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:33,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:45:33,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:33,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:33,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1190148266, now seen corresponding path program 1 times [2024-11-06 19:45:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:33,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981809747] [2024-11-06 19:45:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:33,710 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 19:45:33,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:33,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981809747] [2024-11-06 19:45:33,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981809747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:33,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:33,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:33,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928432082] [2024-11-06 19:45:33,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:33,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:33,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:33,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:33,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:33,712 INFO L87 Difference]: Start difference. First operand 12771 states and 15118 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:35,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:35,908 INFO L93 Difference]: Finished difference Result 36054 states and 43062 transitions. [2024-11-06 19:45:35,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:35,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 359 [2024-11-06 19:45:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:35,941 INFO L225 Difference]: With dead ends: 36054 [2024-11-06 19:45:35,942 INFO L226 Difference]: Without dead ends: 23285 [2024-11-06 19:45:35,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:35,954 INFO L432 NwaCegarLoop]: 1215 mSDtfsCounter, 639 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 3004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:35,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1223 Invalid, 3004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:45:35,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2024-11-06 19:45:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 22534. [2024-11-06 19:45:36,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1720143789109307) internal successors, (26409), 22533 states have internal predecessors, (26409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 26409 transitions. [2024-11-06 19:45:36,174 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 26409 transitions. Word has length 359 [2024-11-06 19:45:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:36,175 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 26409 transitions. [2024-11-06 19:45:36,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:36,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 26409 transitions. [2024-11-06 19:45:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-06 19:45:36,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:36,180 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:36,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:45:36,181 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:36,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:36,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1516330464, now seen corresponding path program 1 times [2024-11-06 19:45:36,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:36,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694018595] [2024-11-06 19:45:36,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:36,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:36,637 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-06 19:45:36,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:36,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694018595] [2024-11-06 19:45:36,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694018595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:36,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:36,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:36,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533379739] [2024-11-06 19:45:36,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:36,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:36,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:36,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:36,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:36,639 INFO L87 Difference]: Start difference. First operand 22534 states and 26409 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:38,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:38,755 INFO L93 Difference]: Finished difference Result 51074 states and 59608 transitions. [2024-11-06 19:45:38,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:38,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 363 [2024-11-06 19:45:38,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:38,794 INFO L225 Difference]: With dead ends: 51074 [2024-11-06 19:45:38,794 INFO L226 Difference]: Without dead ends: 28542 [2024-11-06 19:45:38,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:38,813 INFO L432 NwaCegarLoop]: 961 mSDtfsCounter, 808 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:38,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 969 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 2146 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 19:45:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2024-11-06 19:45:39,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 27040. [2024-11-06 19:45:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.144716890417545) internal successors, (30952), 27039 states have internal predecessors, (30952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30952 transitions. [2024-11-06 19:45:39,065 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 30952 transitions. Word has length 363 [2024-11-06 19:45:39,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:39,066 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 30952 transitions. [2024-11-06 19:45:39,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 30952 transitions. [2024-11-06 19:45:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2024-11-06 19:45:39,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:39,074 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:39,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:45:39,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:39,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2028343573, now seen corresponding path program 1 times [2024-11-06 19:45:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647103082] [2024-11-06 19:45:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:39,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 502 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-06 19:45:39,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:39,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647103082] [2024-11-06 19:45:39,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647103082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:39,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:39,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:39,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441560990] [2024-11-06 19:45:39,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:39,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:39,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:39,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:39,333 INFO L87 Difference]: Start difference. First operand 27040 states and 30952 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:41,419 INFO L93 Difference]: Finished difference Result 54829 states and 62659 transitions. [2024-11-06 19:45:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:41,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 465 [2024-11-06 19:45:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:41,448 INFO L225 Difference]: With dead ends: 54829 [2024-11-06 19:45:41,448 INFO L226 Difference]: Without dead ends: 27791 [2024-11-06 19:45:41,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:41,462 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 663 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:41,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 269 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 19:45:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27791 states. [2024-11-06 19:45:41,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27791 to 27040. [2024-11-06 19:45:41,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27040 states, 27039 states have (on average 1.1338437072376937) internal successors, (30658), 27039 states have internal predecessors, (30658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27040 states to 27040 states and 30658 transitions. [2024-11-06 19:45:41,697 INFO L78 Accepts]: Start accepts. Automaton has 27040 states and 30658 transitions. Word has length 465 [2024-11-06 19:45:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:41,697 INFO L471 AbstractCegarLoop]: Abstraction has 27040 states and 30658 transitions. [2024-11-06 19:45:41,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 27040 states and 30658 transitions. [2024-11-06 19:45:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-11-06 19:45:41,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:41,704 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:41,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:45:41,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:41,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash -763771733, now seen corresponding path program 1 times [2024-11-06 19:45:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432532823] [2024-11-06 19:45:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:41,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 324 proven. 230 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-06 19:45:42,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432532823] [2024-11-06 19:45:42,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432532823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:45:42,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59215858] [2024-11-06 19:45:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:42,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:42,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:45:42,209 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:45:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:45:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:42,355 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:45:42,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:45:42,536 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-06 19:45:42,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:45:42,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59215858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:42,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:45:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:45:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835358673] [2024-11-06 19:45:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:42,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:42,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:42,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:42,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:42,538 INFO L87 Difference]: Start difference. First operand 27040 states and 30658 transitions. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:44,930 INFO L93 Difference]: Finished difference Result 72102 states and 82464 transitions. [2024-11-06 19:45:44,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:44,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 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 476 [2024-11-06 19:45:44,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:44,967 INFO L225 Difference]: With dead ends: 72102 [2024-11-06 19:45:44,967 INFO L226 Difference]: Without dead ends: 45064 [2024-11-06 19:45:44,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:45:44,979 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 665 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 707 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 707 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:44,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 1053 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [707 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:45:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45064 states. [2024-11-06 19:45:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45064 to 45064. [2024-11-06 19:45:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45064 states, 45063 states have (on average 1.141291081374964) internal successors, (51430), 45063 states have internal predecessors, (51430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:45,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45064 states to 45064 states and 51430 transitions. [2024-11-06 19:45:45,324 INFO L78 Accepts]: Start accepts. Automaton has 45064 states and 51430 transitions. Word has length 476 [2024-11-06 19:45:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:45,324 INFO L471 AbstractCegarLoop]: Abstraction has 45064 states and 51430 transitions. [2024-11-06 19:45:45,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 45064 states and 51430 transitions. [2024-11-06 19:45:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2024-11-06 19:45:45,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:45,332 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:45,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:45:45,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:45:45,533 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:45,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash 157968093, now seen corresponding path program 1 times [2024-11-06 19:45:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:45,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839618817] [2024-11-06 19:45:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 522 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-06 19:45:45,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:45,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839618817] [2024-11-06 19:45:45,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839618817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:45,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:45,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:45,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562496994] [2024-11-06 19:45:45,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:45,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:45,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:45,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:45,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:45,706 INFO L87 Difference]: Start difference. First operand 45064 states and 51430 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:47,818 INFO L93 Difference]: Finished difference Result 107399 states and 121876 transitions. [2024-11-06 19:45:47,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:47,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 485 [2024-11-06 19:45:47,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:47,881 INFO L225 Difference]: With dead ends: 107399 [2024-11-06 19:45:47,881 INFO L226 Difference]: Without dead ends: 61586 [2024-11-06 19:45:47,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:47,910 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 732 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:47,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 1074 Invalid, 2767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 19:45:47,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61586 states. [2024-11-06 19:45:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61586 to 55578. [2024-11-06 19:45:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55578 states, 55577 states have (on average 1.1048275365708837) internal successors, (61403), 55577 states have internal predecessors, (61403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:48,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55578 states to 55578 states and 61403 transitions. [2024-11-06 19:45:48,456 INFO L78 Accepts]: Start accepts. Automaton has 55578 states and 61403 transitions. Word has length 485 [2024-11-06 19:45:48,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:48,457 INFO L471 AbstractCegarLoop]: Abstraction has 55578 states and 61403 transitions. [2024-11-06 19:45:48,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:48,457 INFO L276 IsEmpty]: Start isEmpty. Operand 55578 states and 61403 transitions. [2024-11-06 19:45:48,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-11-06 19:45:48,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:48,466 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:48,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:45:48,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:48,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1863923703, now seen corresponding path program 1 times [2024-11-06 19:45:48,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:48,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176698965] [2024-11-06 19:45:48,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:48,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:48,641 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 521 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-06 19:45:48,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:48,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176698965] [2024-11-06 19:45:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176698965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:48,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:48,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:48,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622395318] [2024-11-06 19:45:48,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:48,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:48,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:48,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:48,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:48,643 INFO L87 Difference]: Start difference. First operand 55578 states and 61403 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:51,324 INFO L93 Difference]: Finished difference Result 144198 states and 159788 transitions. [2024-11-06 19:45:51,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:51,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 536 [2024-11-06 19:45:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:51,418 INFO L225 Difference]: With dead ends: 144198 [2024-11-06 19:45:51,418 INFO L226 Difference]: Without dead ends: 89373 [2024-11-06 19:45:51,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:51,460 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 617 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 647 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 647 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:51,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 461 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [647 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:45:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89373 states. [2024-11-06 19:45:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89373 to 87120. [2024-11-06 19:45:52,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87120 states, 87119 states have (on average 1.0904280352161986) internal successors, (94997), 87119 states have internal predecessors, (94997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87120 states to 87120 states and 94997 transitions. [2024-11-06 19:45:52,329 INFO L78 Accepts]: Start accepts. Automaton has 87120 states and 94997 transitions. Word has length 536 [2024-11-06 19:45:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:52,329 INFO L471 AbstractCegarLoop]: Abstraction has 87120 states and 94997 transitions. [2024-11-06 19:45:52,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 87120 states and 94997 transitions. [2024-11-06 19:45:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-11-06 19:45:52,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:52,339 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:45:52,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:45:52,339 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:52,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:52,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1761319115, now seen corresponding path program 1 times [2024-11-06 19:45:52,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:52,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988630636] [2024-11-06 19:45:52,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:52,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:52,767 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 523 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-06 19:45:52,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:52,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988630636] [2024-11-06 19:45:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988630636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:52,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:52,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:52,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970467647] [2024-11-06 19:45:52,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:52,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:52,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:52,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:52,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:52,770 INFO L87 Difference]: Start difference. First operand 87120 states and 94997 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:55,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:55,072 INFO L93 Difference]: Finished difference Result 193764 states and 211555 transitions. [2024-11-06 19:45:55,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:55,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 548 [2024-11-06 19:45:55,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:55,178 INFO L225 Difference]: With dead ends: 193764 [2024-11-06 19:45:55,178 INFO L226 Difference]: Without dead ends: 107397 [2024-11-06 19:45:55,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:55,203 INFO L432 NwaCegarLoop]: 1282 mSDtfsCounter, 581 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 422 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 422 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:55,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1290 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [422 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 19:45:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107397 states. [2024-11-06 19:45:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107397 to 104393. [2024-11-06 19:45:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104393 states, 104392 states have (on average 1.0831768717909418) internal successors, (113075), 104392 states have internal predecessors, (113075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:56,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104393 states to 104393 states and 113075 transitions. [2024-11-06 19:45:56,030 INFO L78 Accepts]: Start accepts. Automaton has 104393 states and 113075 transitions. Word has length 548 [2024-11-06 19:45:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:56,030 INFO L471 AbstractCegarLoop]: Abstraction has 104393 states and 113075 transitions. [2024-11-06 19:45:56,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 104393 states and 113075 transitions. [2024-11-06 19:45:56,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2024-11-06 19:45:56,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:45:56,077 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:56,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:45:56,078 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:45:56,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:45:56,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1928702966, now seen corresponding path program 1 times [2024-11-06 19:45:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:45:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783414442] [2024-11-06 19:45:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:45:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:45:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:45:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2024-11-06 19:45:57,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:45:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783414442] [2024-11-06 19:45:57,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783414442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:45:57,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:45:57,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:45:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716829414] [2024-11-06 19:45:57,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:45:57,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:45:57,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:45:57,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:45:57,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:57,016 INFO L87 Difference]: Start difference. First operand 104393 states and 113075 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:45:59,195 INFO L93 Difference]: Finished difference Result 208782 states and 226251 transitions. [2024-11-06 19:45:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:45:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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 976 [2024-11-06 19:45:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:45:59,198 INFO L225 Difference]: With dead ends: 208782 [2024-11-06 19:45:59,198 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:45:59,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:45:59,268 INFO L432 NwaCegarLoop]: 1106 mSDtfsCounter, 840 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 2534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:45:59,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1113 Invalid, 2534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 19:45:59,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:45:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:45:59,269 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:45:59,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:45:59,269 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 976 [2024-11-06 19:45:59,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:45:59,270 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:45:59,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:45:59,270 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:45:59,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:45:59,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:45:59,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:45:59,275 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:45:59,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:46:01,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:46:01,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:46:01 BoogieIcfgContainer [2024-11-06 19:46:01,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:46:01,086 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:46:01,086 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:46:01,086 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:46:01,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:45:17" (3/4) ... [2024-11-06 19:46:01,089 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:46:01,119 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-06 19:46:01,123 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:46:01,126 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:46:01,130 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:46:01,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:46:01,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:46:01,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:46:01,339 INFO L158 Benchmark]: Toolchain (without parser) took 49139.89ms. Allocated memory was 142.6MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 103.0MB in the beginning and 700.8MB in the end (delta: -597.7MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-06 19:46:01,340 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:46:01,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 903.66ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 68.4MB in the end (delta: 34.5MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. [2024-11-06 19:46:01,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 317.68ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 68.4MB in the beginning and 226.7MB in the end (delta: -158.3MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. [2024-11-06 19:46:01,341 INFO L158 Benchmark]: Boogie Preprocessor took 386.44ms. Allocated memory is still 327.2MB. Free memory was 226.7MB in the beginning and 210.2MB in the end (delta: 16.4MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. [2024-11-06 19:46:01,341 INFO L158 Benchmark]: RCFGBuilder took 3205.25ms. Allocated memory was 327.2MB in the beginning and 419.4MB in the end (delta: 92.3MB). Free memory was 210.2MB in the beginning and 77.2MB in the end (delta: 133.1MB). Peak memory consumption was 236.3MB. Max. memory is 16.1GB. [2024-11-06 19:46:01,341 INFO L158 Benchmark]: TraceAbstraction took 44068.70ms. Allocated memory was 419.4MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 73.1MB in the beginning and 755.3MB in the end (delta: -682.2MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-06 19:46:01,341 INFO L158 Benchmark]: Witness Printer took 252.34ms. Allocated memory is still 2.1GB. Free memory was 755.3MB in the beginning and 700.8MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-06 19:46:01,343 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.17ms. Allocated memory is still 117.4MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 903.66ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 68.4MB in the end (delta: 34.5MB). Peak memory consumption was 80.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 317.68ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 68.4MB in the beginning and 226.7MB in the end (delta: -158.3MB). Peak memory consumption was 78.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 386.44ms. Allocated memory is still 327.2MB. Free memory was 226.7MB in the beginning and 210.2MB in the end (delta: 16.4MB). Peak memory consumption was 62.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3205.25ms. Allocated memory was 327.2MB in the beginning and 419.4MB in the end (delta: 92.3MB). Free memory was 210.2MB in the beginning and 77.2MB in the end (delta: 133.1MB). Peak memory consumption was 236.3MB. Max. memory is 16.1GB. * TraceAbstraction took 44068.70ms. Allocated memory was 419.4MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 73.1MB in the beginning and 755.3MB in the end (delta: -682.2MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 252.34ms. Allocated memory is still 2.1GB. Free memory was 755.3MB in the beginning and 700.8MB in the end (delta: 54.5MB). Peak memory consumption was 58.7MB. 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: 118]: 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, 818 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.2s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10999 SdHoareTripleChecker+Valid, 29.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10999 mSDsluCounter, 10405 SdHoareTripleChecker+Invalid, 24.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 8884 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 31441 IncrementalHoareTripleChecker+Invalid, 40325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8884 mSolverCounterUnsat, 10287 mSDtfsCounter, 31441 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 772 GetRequests, 752 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104393occurred in iteration=12, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 15028 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 5912 NumberOfCodeBlocks, 5912 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 5897 ConstructedInterpolants, 0 QuantifiedInterpolants, 14350 SizeOfPredicates, 0 NumberOfNonLiveVariables, 989 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 5718/6002 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: 4828]: Loop Invariant Derived loop invariant: ((((((((((((a7 <= 13) && (5 == a5)) || (((0 <= ((long long) a17 + 107)) && (a2 <= 189)) && (a17 <= 111))) || (((a2 <= 170) && (a7 == 13)) && (((long long) a17 + 124) <= 0))) || ((a5 != 4) && (a2 <= 189))) || (((0 <= ((long long) a17 + 107)) && (a2 <= 189)) && (a24 != 14))) || (((a24 <= 14) && (14 <= a7)) && (a2 <= 189))) || (((a24 <= 14) && (256 <= a17)) && (a24 != 14))) || ((a24 <= 14) && (5 == a5))) || (((a24 <= 14) && (14 <= a7)) && (a24 != 14))) || (((a24 <= 14) && (a17 <= 111)) && (a24 != 14))) || ((a5 <= 4) && (190 <= a2))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:46:01,364 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