./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i -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 4643bf105c5d297e349c784c5b6d1d7e76636f96e2a0244468d2c82d05f2f0b9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:49:47,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:49:47,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:49:47,543 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:49:47,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:49:47,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:49:47,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:49:47,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:49:47,570 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:49:47,570 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:49:47,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:49:47,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:49:47,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:49:47,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:49:47,571 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:49:47,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:49:47,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:49:47,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:49:47,574 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:49:47,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:49:47,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:49:47,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:49:47,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:49:47,575 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:49:47,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:49:47,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:49:47,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:49:47,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:49:47,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:49:47,576 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 -> 4643bf105c5d297e349c784c5b6d1d7e76636f96e2a0244468d2c82d05f2f0b9 [2025-01-09 10:49:47,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:49:47,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:49:47,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:49:47,810 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:49:47,810 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:49:47,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i [2025-01-09 10:49:48,948 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a23e16462/42019b2b81e54ec2946ff69bd26b1080/FLAG250506045 [2025-01-09 10:49:49,281 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:49:49,281 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i [2025-01-09 10:49:49,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a23e16462/42019b2b81e54ec2946ff69bd26b1080/FLAG250506045 [2025-01-09 10:49:49,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a23e16462/42019b2b81e54ec2946ff69bd26b1080 [2025-01-09 10:49:49,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:49:49,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:49:49,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:49:49,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:49:49,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:49:49,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,541 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49, skipping insertion in model container [2025-01-09 10:49:49,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:49:49,650 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i[919,932] [2025-01-09 10:49:49,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:49:49,750 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:49:49,759 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i[919,932] [2025-01-09 10:49:49,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:49:49,800 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:49:49,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49 WrapperNode [2025-01-09 10:49:49,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:49:49,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:49:49,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:49:49,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:49:49,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,846 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2025-01-09 10:49:49,846 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:49:49,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:49:49,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:49:49,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:49:49,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,884 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]. [2025-01-09 10:49:49,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,896 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,903 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,908 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,911 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:49:49,912 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:49:49,912 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:49:49,912 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:49:49,913 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (1/1) ... [2025-01-09 10:49:49,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:49:49,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:49:49,941 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) [2025-01-09 10:49:49,947 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 [2025-01-09 10:49:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:49:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:49:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:49:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:49:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:49:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:49:50,033 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:49:50,034 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:49:50,406 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 10:49:50,406 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:49:50,416 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:49:50,416 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:49:50,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:49:50 BoogieIcfgContainer [2025-01-09 10:49:50,417 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:49:50,418 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:49:50,418 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:49:50,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:49:50,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:49:49" (1/3) ... [2025-01-09 10:49:50,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774710f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:49:50, skipping insertion in model container [2025-01-09 10:49:50,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:49:49" (2/3) ... [2025-01-09 10:49:50,422 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@774710f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:49:50, skipping insertion in model container [2025-01-09 10:49:50,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:49:50" (3/3) ... [2025-01-09 10:49:50,424 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i [2025-01-09 10:49:50,449 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:49:50,450 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-28.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:49:50,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:49:50,511 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;@1136ca75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:49:50,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:49:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 10:49:50,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:49:50,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:49:50,528 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:49:50,528 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:49:50,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:49:50,534 INFO L85 PathProgramCache]: Analyzing trace with hash 281141858, now seen corresponding path program 1 times [2025-01-09 10:49:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:49:50,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898785388] [2025-01-09 10:49:50,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:49:50,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:50,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:50,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:50,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:49:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 10:49:50,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:49:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898785388] [2025-01-09 10:49:50,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898785388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:49:50,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905809711] [2025-01-09 10:49:50,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:50,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:49:50,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:49:50,815 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) [2025-01-09 10:49:50,817 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 [2025-01-09 10:49:50,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:50,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:50,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:50,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:49:50,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:49:50,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:49:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-01-09 10:49:51,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:49:51,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905809711] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:49:51,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:49:51,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:49:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304721035] [2025-01-09 10:49:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:49:51,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:49:51,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:49:51,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:49:51,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:49:51,048 INFO L87 Difference]: Start difference. First operand has 104 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 73 states have internal predecessors, (103), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 10:49:51,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:49:51,072 INFO L93 Difference]: Finished difference Result 202 states and 346 transitions. [2025-01-09 10:49:51,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:49:51,073 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 194 [2025-01-09 10:49:51,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:49:51,077 INFO L225 Difference]: With dead ends: 202 [2025-01-09 10:49:51,078 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 10:49:51,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:49:51,081 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:49:51,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:49:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 10:49:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 10:49:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3857142857142857) internal successors, (97), 70 states have internal predecessors, (97), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 10:49:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2025-01-09 10:49:51,123 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 194 [2025-01-09 10:49:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:49:51,123 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2025-01-09 10:49:51,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-01-09 10:49:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2025-01-09 10:49:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:49:51,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:49:51,126 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:49:51,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 10:49:51,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:49:51,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:49:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:49:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -294161572, now seen corresponding path program 1 times [2025-01-09 10:49:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:49:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658610405] [2025-01-09 10:49:51,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:51,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:49:51,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:51,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:51,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:51,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:49:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:49:51,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:49:51,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658610405] [2025-01-09 10:49:51,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658610405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:49:51,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:49:51,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:49:51,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354280707] [2025-01-09 10:49:51,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:49:51,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:49:51,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:49:51,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:49:51,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:49:51,634 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:51,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:49:51,916 INFO L93 Difference]: Finished difference Result 348 states and 534 transitions. [2025-01-09 10:49:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:49:51,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-01-09 10:49:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:49:51,919 INFO L225 Difference]: With dead ends: 348 [2025-01-09 10:49:51,920 INFO L226 Difference]: Without dead ends: 250 [2025-01-09 10:49:51,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:49:51,921 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 281 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:49:51,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 375 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:49:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-01-09 10:49:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 173. [2025-01-09 10:49:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 119 states have (on average 1.3781512605042017) internal successors, (164), 120 states have internal predecessors, (164), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 10:49:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2025-01-09 10:49:51,956 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 194 [2025-01-09 10:49:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:49:51,957 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2025-01-09 10:49:51,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2025-01-09 10:49:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:49:51,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:49:51,972 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:49:51,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:49:51,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:49:51,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:49:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash -687188582, now seen corresponding path program 1 times [2025-01-09 10:49:51,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:49:51,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748985950] [2025-01-09 10:49:51,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:49:51,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:52,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:52,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:52,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:49:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:49:52,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:49:52,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748985950] [2025-01-09 10:49:52,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748985950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:49:52,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:49:52,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:49:52,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768097255] [2025-01-09 10:49:52,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:49:52,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:49:52,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:49:52,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:49:52,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:49:52,178 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:49:52,202 INFO L93 Difference]: Finished difference Result 346 states and 535 transitions. [2025-01-09 10:49:52,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:49:52,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-01-09 10:49:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:49:52,206 INFO L225 Difference]: With dead ends: 346 [2025-01-09 10:49:52,207 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 10:49:52,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:49:52,209 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:49:52,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:49:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 10:49:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2025-01-09 10:49:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 123 states have internal predecessors, (167), 51 states have call successors, (51), 2 states have call predecessors, (51), 2 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-01-09 10:49:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 269 transitions. [2025-01-09 10:49:52,230 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 269 transitions. Word has length 194 [2025-01-09 10:49:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:49:52,230 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 269 transitions. [2025-01-09 10:49:52,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 269 transitions. [2025-01-09 10:49:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:49:52,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:49:52,234 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:49:52,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:49:52,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:49:52,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:49:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash 13875996, now seen corresponding path program 1 times [2025-01-09 10:49:52,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:49:52,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761282900] [2025-01-09 10:49:52,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:49:52,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:52,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:52,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:52,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:49:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:49:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:49:52,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761282900] [2025-01-09 10:49:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761282900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:49:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:49:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:49:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409822437] [2025-01-09 10:49:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:49:52,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:49:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:49:52,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:49:52,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:49:52,548 INFO L87 Difference]: Start difference. First operand 176 states and 269 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:49:52,774 INFO L93 Difference]: Finished difference Result 598 states and 916 transitions. [2025-01-09 10:49:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:49:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-01-09 10:49:52,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:49:52,778 INFO L225 Difference]: With dead ends: 598 [2025-01-09 10:49:52,779 INFO L226 Difference]: Without dead ends: 425 [2025-01-09 10:49:52,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:49:52,780 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 167 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:49:52,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 621 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:49:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-01-09 10:49:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 347. [2025-01-09 10:49:52,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 240 states have (on average 1.3708333333333333) internal successors, (329), 242 states have internal predecessors, (329), 102 states have call successors, (102), 4 states have call predecessors, (102), 4 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:49:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 533 transitions. [2025-01-09 10:49:52,822 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 533 transitions. Word has length 194 [2025-01-09 10:49:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:49:52,823 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 533 transitions. [2025-01-09 10:49:52,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 533 transitions. [2025-01-09 10:49:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:49:52,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:49:52,825 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:49:52,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:49:52,825 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:49:52,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:49:52,826 INFO L85 PathProgramCache]: Analyzing trace with hash -126672614, now seen corresponding path program 1 times [2025-01-09 10:49:52,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:49:52,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357760133] [2025-01-09 10:49:52,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:49:52,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:52,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:52,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:52,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:49:53,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:49:53,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:49:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357760133] [2025-01-09 10:49:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357760133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:49:53,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:49:53,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:49:53,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218764997] [2025-01-09 10:49:53,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:49:53,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:49:53,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:49:53,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:49:53,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:49:53,130 INFO L87 Difference]: Start difference. First operand 347 states and 533 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:49:53,251 INFO L93 Difference]: Finished difference Result 745 states and 1146 transitions. [2025-01-09 10:49:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:49:53,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-01-09 10:49:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:49:53,255 INFO L225 Difference]: With dead ends: 745 [2025-01-09 10:49:53,256 INFO L226 Difference]: Without dead ends: 566 [2025-01-09 10:49:53,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:49:53,257 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 135 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:49:53,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 251 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:49:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-09 10:49:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 377. [2025-01-09 10:49:53,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 270 states have (on average 1.3888888888888888) internal successors, (375), 272 states have internal predecessors, (375), 102 states have call successors, (102), 4 states have call predecessors, (102), 4 states have return successors, (102), 100 states have call predecessors, (102), 102 states have call successors, (102) [2025-01-09 10:49:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 579 transitions. [2025-01-09 10:49:53,298 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 579 transitions. Word has length 194 [2025-01-09 10:49:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:49:53,298 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 579 transitions. [2025-01-09 10:49:53,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:49:53,300 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 579 transitions. [2025-01-09 10:49:53,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:49:53,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:49:53,302 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:49:53,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:49:53,302 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:49:53,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:49:53,302 INFO L85 PathProgramCache]: Analyzing trace with hash -320451618, now seen corresponding path program 1 times [2025-01-09 10:49:53,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:49:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371649231] [2025-01-09 10:49:53,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:49:53,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:49:53,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:49:53,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:49:53,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:49:53,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:25,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:51:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371649231] [2025-01-09 10:51:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371649231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:25,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 10:51:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93696534] [2025-01-09 10:51:25,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:25,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:51:25,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:25,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:51:25,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:51:25,758 INFO L87 Difference]: Start difference. First operand 377 states and 579 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:51:28,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:28,128 INFO L93 Difference]: Finished difference Result 1348 states and 2054 transitions. [2025-01-09 10:51:28,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 10:51:28,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-01-09 10:51:28,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:28,134 INFO L225 Difference]: With dead ends: 1348 [2025-01-09 10:51:28,134 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 10:51:28,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2025-01-09 10:51:28,136 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 661 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:28,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 709 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:51:28,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 10:51:28,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 796. [2025-01-09 10:51:28,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 583 states have (on average 1.397941680960549) internal successors, (815), 587 states have internal predecessors, (815), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 200 states have call predecessors, (204), 204 states have call successors, (204) [2025-01-09 10:51:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1223 transitions. [2025-01-09 10:51:28,198 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1223 transitions. Word has length 194 [2025-01-09 10:51:28,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:28,199 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1223 transitions. [2025-01-09 10:51:28,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:51:28,199 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1223 transitions. [2025-01-09 10:51:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:51:28,201 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:28,201 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:28,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:51:28,201 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:28,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:28,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2009395360, now seen corresponding path program 1 times [2025-01-09 10:51:28,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:28,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549465282] [2025-01-09 10:51:28,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:28,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:28,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:51:28,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:51:28,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:28,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:51:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-01-09 10:51:28,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:51:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549465282] [2025-01-09 10:51:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549465282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:51:28,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:51:28,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:51:28,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928103343] [2025-01-09 10:51:28,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:51:28,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:51:28,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:51:28,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:51:28,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:51:28,314 INFO L87 Difference]: Start difference. First operand 796 states and 1223 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:51:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:51:28,598 INFO L93 Difference]: Finished difference Result 2195 states and 3376 transitions. [2025-01-09 10:51:28,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:51:28,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-01-09 10:51:28,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:51:28,607 INFO L225 Difference]: With dead ends: 2195 [2025-01-09 10:51:28,607 INFO L226 Difference]: Without dead ends: 1402 [2025-01-09 10:51:28,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:51:28,613 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 412 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:51:28,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 590 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:51:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2025-01-09 10:51:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 925. [2025-01-09 10:51:28,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 712 states have (on average 1.4185393258426966) internal successors, (1010), 716 states have internal predecessors, (1010), 204 states have call successors, (204), 8 states have call predecessors, (204), 8 states have return successors, (204), 200 states have call predecessors, (204), 204 states have call successors, (204) [2025-01-09 10:51:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1418 transitions. [2025-01-09 10:51:28,688 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1418 transitions. Word has length 194 [2025-01-09 10:51:28,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:51:28,689 INFO L471 AbstractCegarLoop]: Abstraction has 925 states and 1418 transitions. [2025-01-09 10:51:28,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-01-09 10:51:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1418 transitions. [2025-01-09 10:51:28,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-01-09 10:51:28,693 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:51:28,694 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:51:28,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:51:28,694 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:51:28,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:51:28,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1932110948, now seen corresponding path program 1 times [2025-01-09 10:51:28,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:51:28,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755964959] [2025-01-09 10:51:28,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:51:28,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:51:28,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 10:51:28,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 10:51:28,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:51:28,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat