./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-33.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_fillercodesize_ps-cn-250_file-33.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 0fae542ffc508d581529777e32a74e7eca7b7550b33272b19a75a08e2a9e3ba4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:41:51,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:41:51,885 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:41:51,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:41:51,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:41:51,924 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:41:51,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:41:51,925 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:41:51,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:41:51,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:41:51,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:41:51,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:41:51,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:41:51,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:41:51,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:41:51,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:41:51,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:41:51,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:41:51,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:41:51,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:41:51,929 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 -> 0fae542ffc508d581529777e32a74e7eca7b7550b33272b19a75a08e2a9e3ba4 [2025-01-09 09:41:52,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:41:52,234 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:41:52,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:41:52,239 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:41:52,239 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:41:52,240 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-33.i [2025-01-09 09:41:53,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a89a7e142/ec376f195d4f4b1ab9dc50329c84fff7/FLAG7a073d738 [2025-01-09 09:41:53,953 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:41:53,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-33.i [2025-01-09 09:41:53,963 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a89a7e142/ec376f195d4f4b1ab9dc50329c84fff7/FLAG7a073d738 [2025-01-09 09:41:53,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a89a7e142/ec376f195d4f4b1ab9dc50329c84fff7 [2025-01-09 09:41:53,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:41:53,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:41:53,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:41:53,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:41:53,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:41:53,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:41:53" (1/1) ... [2025-01-09 09:41:53,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e8ab34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:53, skipping insertion in model container [2025-01-09 09:41:53,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:41:53" (1/1) ... [2025-01-09 09:41:54,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:41:54,145 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_fillercodesize_ps-cn-250_file-33.i[916,929] [2025-01-09 09:41:54,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:41:54,302 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:41:54,314 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_fillercodesize_ps-cn-250_file-33.i[916,929] [2025-01-09 09:41:54,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:41:54,406 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:41:54,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54 WrapperNode [2025-01-09 09:41:54,407 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:41:54,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:41:54,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:41:54,409 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:41:54,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,480 INFO L138 Inliner]: procedures = 26, calls = 99, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 595 [2025-01-09 09:41:54,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:41:54,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:41:54,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:41:54,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:41:54,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,544 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 09:41:54,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,546 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,569 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,591 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:41:54,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:41:54,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:41:54,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:41:54,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (1/1) ... [2025-01-09 09:41:54,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:41:54,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:41:54,646 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 09:41:54,649 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 09:41:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:41:54,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:41:54,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:41:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:41:54,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:41:54,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:41:54,801 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:41:54,803 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:41:55,777 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 09:41:55,777 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:41:55,800 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:41:55,800 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:41:55,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:41:55 BoogieIcfgContainer [2025-01-09 09:41:55,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:41:55,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:41:55,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:41:55,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:41:55,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:41:53" (1/3) ... [2025-01-09 09:41:55,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771b169e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:41:55, skipping insertion in model container [2025-01-09 09:41:55,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:41:54" (2/3) ... [2025-01-09 09:41:55,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@771b169e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:41:55, skipping insertion in model container [2025-01-09 09:41:55,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:41:55" (3/3) ... [2025-01-09 09:41:55,812 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-33.i [2025-01-09 09:41:55,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:41:55,831 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-33.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:41:55,905 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:41:55,919 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;@35d78a87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:41:55,920 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:41:55,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 167 states have (on average 1.532934131736527) internal successors, (256), 168 states have internal predecessors, (256), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 09:41:55,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 09:41:55,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:55,960 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:55,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:55,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:55,966 INFO L85 PathProgramCache]: Analyzing trace with hash 527504442, now seen corresponding path program 1 times [2025-01-09 09:41:55,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:55,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292566703] [2025-01-09 09:41:55,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:55,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:56,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 09:41:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 09:41:56,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:56,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-01-09 09:41:56,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:41:56,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292566703] [2025-01-09 09:41:56,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292566703] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:41:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791382611] [2025-01-09 09:41:56,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:56,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:41:56,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:41:56,603 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 09:41:56,605 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 09:41:56,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 09:41:56,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 09:41:56,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:56,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:56,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:41:56,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:41:57,029 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 14450 trivial. 0 not checked. [2025-01-09 09:41:57,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:41:57,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791382611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:41:57,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:41:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:41:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061634179] [2025-01-09 09:41:57,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:41:57,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:41:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:41:57,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:41:57,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:41:57,062 INFO L87 Difference]: Start difference. First operand has 256 states, 167 states have (on average 1.532934131736527) internal successors, (256), 168 states have internal predecessors, (256), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:41:57,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:57,118 INFO L93 Difference]: Finished difference Result 506 states and 937 transitions. [2025-01-09 09:41:57,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:41:57,120 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) Word has length 533 [2025-01-09 09:41:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:57,127 INFO L225 Difference]: With dead ends: 506 [2025-01-09 09:41:57,128 INFO L226 Difference]: Without dead ends: 253 [2025-01-09 09:41:57,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 534 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 09:41:57,135 INFO L435 NwaCegarLoop]: 421 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, 421 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 09:41:57,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:41:57,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-01-09 09:41:57,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-01-09 09:41:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 165 states have (on average 1.509090909090909) internal successors, (249), 165 states have internal predecessors, (249), 86 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2025-01-09 09:41:57,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 421 transitions. [2025-01-09 09:41:57,217 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 421 transitions. Word has length 533 [2025-01-09 09:41:57,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:57,217 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 421 transitions. [2025-01-09 09:41:57,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 2 states have call successors, (86), 2 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 2 states have call successors, (86) [2025-01-09 09:41:57,218 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 421 transitions. [2025-01-09 09:41:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 09:41:57,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:57,234 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:57,245 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 09:41:57,435 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 09:41:57,435 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:57,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:57,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1526976694, now seen corresponding path program 1 times [2025-01-09 09:41:57,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:57,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248376192] [2025-01-09 09:41:57,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:57,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:57,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 09:41:57,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 09:41:57,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:57,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:58,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:41:58,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:41:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248376192] [2025-01-09 09:41:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248376192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:41:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:41:58,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:41:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170768277] [2025-01-09 09:41:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:41:58,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:41:58,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:41:58,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:41:58,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:41:58,183 INFO L87 Difference]: Start difference. First operand 253 states and 421 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:41:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:41:58,287 INFO L93 Difference]: Finished difference Result 748 states and 1248 transitions. [2025-01-09 09:41:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:41:58,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 533 [2025-01-09 09:41:58,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:41:58,300 INFO L225 Difference]: With dead ends: 748 [2025-01-09 09:41:58,300 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 09:41:58,302 INFO L434 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 [2025-01-09 09:41:58,303 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 400 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:41:58,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1138 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:41:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 09:41:58,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2025-01-09 09:41:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 321 states have internal predecessors, (483), 172 states have call successors, (172), 2 states have call predecessors, (172), 2 states have return successors, (172), 172 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 09:41:58,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 827 transitions. [2025-01-09 09:41:58,405 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 827 transitions. Word has length 533 [2025-01-09 09:41:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:58,407 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 827 transitions. [2025-01-09 09:41:58,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:41:58,407 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 827 transitions. [2025-01-09 09:41:58,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 09:41:58,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:58,415 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:58,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:41:58,415 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:58,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:58,416 INFO L85 PathProgramCache]: Analyzing trace with hash -844762568, now seen corresponding path program 1 times [2025-01-09 09:41:58,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:58,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995248098] [2025-01-09 09:41:58,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:58,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:58,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 09:41:58,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 09:41:58,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:58,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:42:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:00,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995248098] [2025-01-09 09:42:00,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995248098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:00,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:00,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:42:00,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294819315] [2025-01-09 09:42:00,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:00,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:42:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:00,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:42:00,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:42:00,069 INFO L87 Difference]: Start difference. First operand 496 states and 827 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:00,912 INFO L93 Difference]: Finished difference Result 2068 states and 3463 transitions. [2025-01-09 09:42:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:42:00,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 533 [2025-01-09 09:42:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:00,928 INFO L225 Difference]: With dead ends: 2068 [2025-01-09 09:42:00,929 INFO L226 Difference]: Without dead ends: 1575 [2025-01-09 09:42:00,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:42:00,933 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 905 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:00,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1737 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 09:42:00,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-01-09 09:42:01,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1565. [2025-01-09 09:42:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1565 states, 1124 states have (on average 1.5658362989323844) internal successors, (1760), 1128 states have internal predecessors, (1760), 432 states have call successors, (432), 8 states have call predecessors, (432), 8 states have return successors, (432), 428 states have call predecessors, (432), 432 states have call successors, (432) [2025-01-09 09:42:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2624 transitions. [2025-01-09 09:42:01,158 INFO L78 Accepts]: Start accepts. Automaton has 1565 states and 2624 transitions. Word has length 533 [2025-01-09 09:42:01,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:01,160 INFO L471 AbstractCegarLoop]: Abstraction has 1565 states and 2624 transitions. [2025-01-09 09:42:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:01,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1565 states and 2624 transitions. [2025-01-09 09:42:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 09:42:01,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:01,168 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:01,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:42:01,168 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:01,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:01,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1642512752, now seen corresponding path program 1 times [2025-01-09 09:42:01,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353377097] [2025-01-09 09:42:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:01,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 09:42:01,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 09:42:01,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:01,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:42:01,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:01,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353377097] [2025-01-09 09:42:01,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353377097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:01,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:01,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:42:01,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837053837] [2025-01-09 09:42:01,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:01,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:42:01,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:01,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:42:01,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:01,840 INFO L87 Difference]: Start difference. First operand 1565 states and 2624 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:02,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:02,634 INFO L93 Difference]: Finished difference Result 5783 states and 9703 transitions. [2025-01-09 09:42:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:42:02,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 534 [2025-01-09 09:42:02,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:02,674 INFO L225 Difference]: With dead ends: 5783 [2025-01-09 09:42:02,674 INFO L226 Difference]: Without dead ends: 4221 [2025-01-09 09:42:02,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 09:42:02,685 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 633 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:02,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1510 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:42:02,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4221 states. [2025-01-09 09:42:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4221 to 4213. [2025-01-09 09:42:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4213 states, 3140 states have (on average 1.578343949044586) internal successors, (4956), 3156 states have internal predecessors, (4956), 1048 states have call successors, (1048), 24 states have call predecessors, (1048), 24 states have return successors, (1048), 1032 states have call predecessors, (1048), 1048 states have call successors, (1048) [2025-01-09 09:42:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4213 states to 4213 states and 7052 transitions. [2025-01-09 09:42:03,185 INFO L78 Accepts]: Start accepts. Automaton has 4213 states and 7052 transitions. Word has length 534 [2025-01-09 09:42:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 4213 states and 7052 transitions. [2025-01-09 09:42:03,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4213 states and 7052 transitions. [2025-01-09 09:42:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 09:42:03,195 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:03,196 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:03,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:42:03,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:03,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1890659246, now seen corresponding path program 1 times [2025-01-09 09:42:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658569943] [2025-01-09 09:42:03,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:03,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 09:42:03,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 09:42:03,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:03,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:04,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:42:04,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:04,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658569943] [2025-01-09 09:42:04,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658569943] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:04,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:04,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:04,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047000300] [2025-01-09 09:42:04,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:04,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:04,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:04,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:04,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:04,260 INFO L87 Difference]: Start difference. First operand 4213 states and 7052 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:05,000 INFO L93 Difference]: Finished difference Result 10562 states and 17719 transitions. [2025-01-09 09:42:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:05,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 534 [2025-01-09 09:42:05,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:05,047 INFO L225 Difference]: With dead ends: 10562 [2025-01-09 09:42:05,047 INFO L226 Difference]: Without dead ends: 6352 [2025-01-09 09:42:05,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:05,066 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 383 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:05,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1200 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:42:05,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6352 states. [2025-01-09 09:42:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6352 to 6062. [2025-01-09 09:42:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6062 states, 4902 states have (on average 1.620767033863729) internal successors, (7945), 4918 states have internal predecessors, (7945), 1134 states have call successors, (1134), 25 states have call predecessors, (1134), 25 states have return successors, (1134), 1118 states have call predecessors, (1134), 1134 states have call successors, (1134) [2025-01-09 09:42:05,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6062 states to 6062 states and 10213 transitions. [2025-01-09 09:42:05,543 INFO L78 Accepts]: Start accepts. Automaton has 6062 states and 10213 transitions. Word has length 534 [2025-01-09 09:42:05,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:05,545 INFO L471 AbstractCegarLoop]: Abstraction has 6062 states and 10213 transitions. [2025-01-09 09:42:05,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 6062 states and 10213 transitions. [2025-01-09 09:42:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2025-01-09 09:42:05,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:05,557 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:05,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:42:05,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:05,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:05,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1501535229, now seen corresponding path program 1 times [2025-01-09 09:42:05,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:05,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774359568] [2025-01-09 09:42:05,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:05,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:05,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 535 statements into 1 equivalence classes. [2025-01-09 09:42:05,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 535 of 535 statements. [2025-01-09 09:42:05,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:05,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:42:06,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:06,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774359568] [2025-01-09 09:42:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774359568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:06,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:42:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113742860] [2025-01-09 09:42:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:06,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:42:06,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:06,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:42:06,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:42:06,137 INFO L87 Difference]: Start difference. First operand 6062 states and 10213 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:06,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:06,839 INFO L93 Difference]: Finished difference Result 10778 states and 17983 transitions. [2025-01-09 09:42:06,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:42:06,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 535 [2025-01-09 09:42:06,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:06,886 INFO L225 Difference]: With dead ends: 10778 [2025-01-09 09:42:06,886 INFO L226 Difference]: Without dead ends: 6256 [2025-01-09 09:42:06,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:06,905 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 380 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:06,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 1205 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:42:06,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2025-01-09 09:42:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6086. [2025-01-09 09:42:07,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 4926 states have (on average 1.6128704831506293) internal successors, (7945), 4942 states have internal predecessors, (7945), 1134 states have call successors, (1134), 25 states have call predecessors, (1134), 25 states have return successors, (1134), 1118 states have call predecessors, (1134), 1134 states have call successors, (1134) [2025-01-09 09:42:07,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 10213 transitions. [2025-01-09 09:42:07,351 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 10213 transitions. Word has length 535 [2025-01-09 09:42:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:07,352 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 10213 transitions. [2025-01-09 09:42:07,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 10213 transitions. [2025-01-09 09:42:07,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:42:07,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:07,361 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:07,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:42:07,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:07,362 INFO L85 PathProgramCache]: Analyzing trace with hash -802057429, now seen corresponding path program 1 times [2025-01-09 09:42:07,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:07,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958269547] [2025-01-09 09:42:07,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:07,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:07,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:42:07,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:42:07,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:07,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:42:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14620 trivial. 0 not checked. [2025-01-09 09:42:08,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:42:08,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958269547] [2025-01-09 09:42:08,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958269547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:42:08,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:42:08,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:42:08,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558440115] [2025-01-09 09:42:08,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:42:08,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:42:08,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:42:08,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:42:08,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:08,066 INFO L87 Difference]: Start difference. First operand 6086 states and 10213 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:09,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:42:09,030 INFO L93 Difference]: Finished difference Result 18832 states and 30944 transitions. [2025-01-09 09:42:09,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:42:09,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) Word has length 536 [2025-01-09 09:42:09,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:42:09,168 INFO L225 Difference]: With dead ends: 18832 [2025-01-09 09:42:09,169 INFO L226 Difference]: Without dead ends: 14286 [2025-01-09 09:42:09,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:42:09,186 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 692 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:42:09,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1577 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:42:09,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14286 states. [2025-01-09 09:42:09,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14286 to 10294. [2025-01-09 09:42:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10294 states, 8429 states have (on average 1.605884446553565) internal successors, (13536), 8469 states have internal predecessors, (13536), 1814 states have call successors, (1814), 50 states have call predecessors, (1814), 50 states have return successors, (1814), 1774 states have call predecessors, (1814), 1814 states have call successors, (1814) [2025-01-09 09:42:10,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10294 states to 10294 states and 17164 transitions. [2025-01-09 09:42:10,064 INFO L78 Accepts]: Start accepts. Automaton has 10294 states and 17164 transitions. Word has length 536 [2025-01-09 09:42:10,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:42:10,065 INFO L471 AbstractCegarLoop]: Abstraction has 10294 states and 17164 transitions. [2025-01-09 09:42:10,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (86), 1 states have call predecessors, (86), 1 states have return successors, (86), 1 states have call predecessors, (86), 1 states have call successors, (86) [2025-01-09 09:42:10,066 INFO L276 IsEmpty]: Start isEmpty. Operand 10294 states and 17164 transitions. [2025-01-09 09:42:10,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-01-09 09:42:10,079 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:42:10,081 INFO L218 NwaCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:42:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:42:10,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:42:10,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:42:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -661508819, now seen corresponding path program 1 times [2025-01-09 09:42:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:42:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612181242] [2025-01-09 09:42:10,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:42:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:42:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-01-09 09:42:10,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-01-09 09:42:10,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:42:10,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat