./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 cb1c4114bfb0472867e70fb2c8f5009a549c16b521c64e275202f167415d6d46 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:47:36,072 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:47:36,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:47:36,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:47:36,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:47:36,149 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:47:36,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:47:36,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:47:36,150 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:47:36,150 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:47:36,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:47:36,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:47:36,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:47:36,151 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:47:36,151 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:47:36,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:36,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:47:36,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:47:36,152 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/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 -> cb1c4114bfb0472867e70fb2c8f5009a549c16b521c64e275202f167415d6d46 [2025-03-08 15:47:36,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:47:36,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:47:36,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:47:36,386 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:47:36,386 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:47:36,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i [2025-03-08 15:47:37,526 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40cff916/285a7542b9cf4b1984b59bb80694a70c/FLAG207b78d9e [2025-03-08 15:47:37,877 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:47:37,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i [2025-03-08 15:47:37,893 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40cff916/285a7542b9cf4b1984b59bb80694a70c/FLAG207b78d9e [2025-03-08 15:47:38,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a40cff916/285a7542b9cf4b1984b59bb80694a70c [2025-03-08 15:47:38,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:47:38,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:47:38,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:38,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:47:38,127 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:47:38,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66958959 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38, skipping insertion in model container [2025-03-08 15:47:38,130 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:47:38,279 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i[916,929] [2025-03-08 15:47:38,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:38,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:47:38,495 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i[916,929] [2025-03-08 15:47:38,605 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:47:38,620 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:47:38,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38 WrapperNode [2025-03-08 15:47:38,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:47:38,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:38,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:47:38,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:47:38,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,645 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,725 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 807 [2025-03-08 15:47:38,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:47:38,726 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:47:38,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:47:38,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:47:38,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,828 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-03-08 15:47:38,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,828 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:47:38,910 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:47:38,910 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:47:38,910 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:47:38,911 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (1/1) ... [2025-03-08 15:47:38,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:47:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:38,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:47:38,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:47:38,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:47:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:47:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:47:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:47:38,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:47:39,073 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:47:39,075 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:47:40,024 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L623: havoc property_#t~bitwise55#1;havoc property_#t~short56#1;havoc property_#t~ite59#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1;havoc property_#t~short60#1;havoc property_#t~ite64#1;havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short65#1;havoc property_#t~bitwise66#1;havoc property_#t~bitwise67#1;havoc property_#t~short68#1;havoc property_#t~bitwise69#1;havoc property_#t~short70#1;havoc property_#t~bitwise71#1;havoc property_#t~bitwise72#1;havoc property_#t~short73#1;havoc property_#t~ite76#1;havoc property_#t~bitwise74#1;havoc property_#t~short75#1;havoc property_#t~short77#1; [2025-03-08 15:47:40,140 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-08 15:47:40,140 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:47:40,174 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:47:40,177 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:47:40,178 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:40 BoogieIcfgContainer [2025-03-08 15:47:40,178 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:47:40,180 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:47:40,180 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:47:40,187 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:47:40,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:47:38" (1/3) ... [2025-03-08 15:47:40,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff3edee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:40, skipping insertion in model container [2025-03-08 15:47:40,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:47:38" (2/3) ... [2025-03-08 15:47:40,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff3edee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:47:40, skipping insertion in model container [2025-03-08 15:47:40,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:47:40" (3/3) ... [2025-03-08 15:47:40,189 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-78.i [2025-03-08 15:47:40,199 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:47:40,201 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-78.i that has 2 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:47:40,256 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:47:40,267 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;@2c6fadb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:47:40,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:47:40,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 249 states have (on average 1.538152610441767) internal successors, (383), 250 states have internal predecessors, (383), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 15:47:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 15:47:40,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:40,313 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:40,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:40,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:40,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1246865255, now seen corresponding path program 1 times [2025-03-08 15:47:40,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251210174] [2025-03-08 15:47:40,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:40,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 15:47:40,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 15:47:40,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:40,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-08 15:47:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:40,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251210174] [2025-03-08 15:47:40,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251210174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:40,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677028300] [2025-03-08 15:47:40,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:40,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:40,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:40,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:40,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:47:41,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 15:47:41,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 15:47:41,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:41,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:41,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:47:41,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-03-08 15:47:41,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:47:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677028300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:41,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:47:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:47:41,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756642036] [2025-03-08 15:47:41,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:47:41,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:41,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:47:41,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:47:41,321 INFO L87 Difference]: Start difference. First operand has 320 states, 249 states have (on average 1.538152610441767) internal successors, (383), 250 states have internal predecessors, (383), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-08 15:47:41,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:41,421 INFO L93 Difference]: Finished difference Result 634 states and 1101 transitions. [2025-03-08 15:47:41,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:47:41,424 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 477 [2025-03-08 15:47:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:41,434 INFO L225 Difference]: With dead ends: 634 [2025-03-08 15:47:41,435 INFO L226 Difference]: Without dead ends: 317 [2025-03-08 15:47:41,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 478 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-03-08 15:47:41,444 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:41,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 496 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-08 15:47:41,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-03-08 15:47:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 247 states have (on average 1.5303643724696356) internal successors, (378), 247 states have internal predecessors, (378), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-08 15:47:41,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 514 transitions. [2025-03-08 15:47:41,514 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 514 transitions. Word has length 477 [2025-03-08 15:47:41,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 514 transitions. [2025-03-08 15:47:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-03-08 15:47:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 514 transitions. [2025-03-08 15:47:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-08 15:47:41,526 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:41,526 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:41,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:47:41,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:47:41,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:41,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:41,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1332960611, now seen corresponding path program 1 times [2025-03-08 15:47:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:41,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110394438] [2025-03-08 15:47:41,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:41,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 15:47:41,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 15:47:41,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:41,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:42,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 66 proven. 135 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:47:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110394438] [2025-03-08 15:47:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110394438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:42,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362270556] [2025-03-08 15:47:42,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:42,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:42,713 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:42,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:47:42,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-08 15:47:43,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-08 15:47:43,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:43,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:43,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 15:47:43,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:43,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:43,547 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:47:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362270556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:43,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:47:43,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-08 15:47:43,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176969755] [2025-03-08 15:47:43,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:43,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:43,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:43,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:43,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:47:43,552 INFO L87 Difference]: Start difference. First operand 317 states and 514 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:43,852 INFO L93 Difference]: Finished difference Result 946 states and 1537 transitions. [2025-03-08 15:47:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 477 [2025-03-08 15:47:43,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:43,858 INFO L225 Difference]: With dead ends: 946 [2025-03-08 15:47:43,858 INFO L226 Difference]: Without dead ends: 632 [2025-03-08 15:47:43,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:47:43,859 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 446 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:43,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1451 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:47:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-08 15:47:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 595. [2025-03-08 15:47:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 456 states have (on average 1.5350877192982457) internal successors, (700), 456 states have internal predecessors, (700), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 15:47:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 972 transitions. [2025-03-08 15:47:43,922 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 972 transitions. Word has length 477 [2025-03-08 15:47:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:43,924 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 972 transitions. [2025-03-08 15:47:43,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 3 states have internal predecessors, (140), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:43,924 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 972 transitions. [2025-03-08 15:47:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 15:47:43,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:43,932 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:43,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:47:44,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 15:47:44,137 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:44,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1681560350, now seen corresponding path program 1 times [2025-03-08 15:47:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477483918] [2025-03-08 15:47:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 15:47:44,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 15:47:44,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:44,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:44,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:44,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477483918] [2025-03-08 15:47:44,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477483918] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:44,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:44,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:44,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407267758] [2025-03-08 15:47:44,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:44,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:44,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:44,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:44,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:44,425 INFO L87 Difference]: Start difference. First operand 595 states and 972 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:44,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:44,596 INFO L93 Difference]: Finished difference Result 1425 states and 2336 transitions. [2025-03-08 15:47:44,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:44,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 478 [2025-03-08 15:47:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:44,603 INFO L225 Difference]: With dead ends: 1425 [2025-03-08 15:47:44,603 INFO L226 Difference]: Without dead ends: 995 [2025-03-08 15:47:44,604 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-03-08 15:47:44,605 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 436 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1325 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:44,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1325 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:44,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-08 15:47:44,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 829. [2025-03-08 15:47:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 690 states have (on average 1.5768115942028986) internal successors, (1088), 690 states have internal predecessors, (1088), 136 states have call successors, (136), 2 states have call predecessors, (136), 2 states have return successors, (136), 136 states have call predecessors, (136), 136 states have call successors, (136) [2025-03-08 15:47:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1360 transitions. [2025-03-08 15:47:44,670 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1360 transitions. Word has length 478 [2025-03-08 15:47:44,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1360 transitions. [2025-03-08 15:47:44,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1360 transitions. [2025-03-08 15:47:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 15:47:44,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:44,679 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:44,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:47:44,679 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:44,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1110309117, now seen corresponding path program 1 times [2025-03-08 15:47:44,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:44,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633799863] [2025-03-08 15:47:44,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:44,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:44,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 15:47:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 15:47:44,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:44,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633799863] [2025-03-08 15:47:44,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633799863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:44,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:44,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578352625] [2025-03-08 15:47:44,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:44,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:44,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:44,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:44,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:44,963 INFO L87 Difference]: Start difference. First operand 829 states and 1360 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:45,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:45,113 INFO L93 Difference]: Finished difference Result 2026 states and 3324 transitions. [2025-03-08 15:47:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:45,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 478 [2025-03-08 15:47:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:45,123 INFO L225 Difference]: With dead ends: 2026 [2025-03-08 15:47:45,124 INFO L226 Difference]: Without dead ends: 1519 [2025-03-08 15:47:45,126 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-03-08 15:47:45,129 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 448 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:45,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 1177 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-03-08 15:47:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2025-03-08 15:47:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1307 states have (on average 1.592195868400918) internal successors, (2081), 1307 states have internal predecessors, (2081), 204 states have call successors, (204), 3 states have call predecessors, (204), 3 states have return successors, (204), 204 states have call predecessors, (204), 204 states have call successors, (204) [2025-03-08 15:47:45,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2489 transitions. [2025-03-08 15:47:45,207 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2489 transitions. Word has length 478 [2025-03-08 15:47:45,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:45,208 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2489 transitions. [2025-03-08 15:47:45,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2489 transitions. [2025-03-08 15:47:45,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-08 15:47:45,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:45,211 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:45,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:47:45,212 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:45,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:45,212 INFO L85 PathProgramCache]: Analyzing trace with hash -134455364, now seen corresponding path program 1 times [2025-03-08 15:47:45,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:45,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970498170] [2025-03-08 15:47:45,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:45,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:45,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-08 15:47:45,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-08 15:47:45,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:45,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970498170] [2025-03-08 15:47:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970498170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:45,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:45,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:45,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929972351] [2025-03-08 15:47:45,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:45,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:45,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:45,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:45,903 INFO L87 Difference]: Start difference. First operand 1515 states and 2489 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:46,052 INFO L93 Difference]: Finished difference Result 3323 states and 5464 transitions. [2025-03-08 15:47:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 478 [2025-03-08 15:47:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:46,062 INFO L225 Difference]: With dead ends: 3323 [2025-03-08 15:47:46,062 INFO L226 Difference]: Without dead ends: 2206 [2025-03-08 15:47:46,065 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-03-08 15:47:46,066 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 382 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:46,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1063 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:46,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-03-08 15:47:46,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2202. [2025-03-08 15:47:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 1925 states have (on average 1.594805194805195) internal successors, (3070), 1925 states have internal predecessors, (3070), 272 states have call successors, (272), 4 states have call predecessors, (272), 4 states have return successors, (272), 272 states have call predecessors, (272), 272 states have call successors, (272) [2025-03-08 15:47:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3614 transitions. [2025-03-08 15:47:46,147 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3614 transitions. Word has length 478 [2025-03-08 15:47:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:46,148 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 3614 transitions. [2025-03-08 15:47:46,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:46,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3614 transitions. [2025-03-08 15:47:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-08 15:47:46,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:46,153 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:46,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:47:46,153 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:46,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1539986198, now seen corresponding path program 1 times [2025-03-08 15:47:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:46,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234053713] [2025-03-08 15:47:46,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:46,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:46,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-08 15:47:46,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-08 15:47:46,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:46,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:46,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234053713] [2025-03-08 15:47:46,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234053713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:46,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:46,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:46,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660094426] [2025-03-08 15:47:46,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:46,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:46,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:46,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:46,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:46,771 INFO L87 Difference]: Start difference. First operand 2202 states and 3614 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:46,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:46,974 INFO L93 Difference]: Finished difference Result 5507 states and 9024 transitions. [2025-03-08 15:47:46,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:46,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-08 15:47:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:46,994 INFO L225 Difference]: With dead ends: 5507 [2025-03-08 15:47:46,995 INFO L226 Difference]: Without dead ends: 3661 [2025-03-08 15:47:47,001 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-03-08 15:47:47,002 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 359 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:47,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 968 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2025-03-08 15:47:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 3584. [2025-03-08 15:47:47,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3584 states, 3100 states have (on average 1.5751612903225807) internal successors, (4883), 3100 states have internal predecessors, (4883), 476 states have call successors, (476), 7 states have call predecessors, (476), 7 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-08 15:47:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5835 transitions. [2025-03-08 15:47:47,183 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5835 transitions. Word has length 479 [2025-03-08 15:47:47,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:47,184 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5835 transitions. [2025-03-08 15:47:47,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5835 transitions. [2025-03-08 15:47:47,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-08 15:47:47,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:47,189 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:47,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:47:47,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:47,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1259636309, now seen corresponding path program 1 times [2025-03-08 15:47:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:47,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846767419] [2025-03-08 15:47:47,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:47,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:47,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-08 15:47:47,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-08 15:47:47,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:47,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:48,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:48,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846767419] [2025-03-08 15:47:48,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846767419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:48,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:48,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:48,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72204566] [2025-03-08 15:47:48,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:48,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:48,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:48,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:48,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:48,158 INFO L87 Difference]: Start difference. First operand 3584 states and 5835 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:48,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:48,571 INFO L93 Difference]: Finished difference Result 8035 states and 13093 transitions. [2025-03-08 15:47:48,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:48,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-08 15:47:48,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:48,592 INFO L225 Difference]: With dead ends: 8035 [2025-03-08 15:47:48,592 INFO L226 Difference]: Without dead ends: 4576 [2025-03-08 15:47:48,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03-08 15:47:48,600 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1004 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:48,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1534 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-03-08 15:47:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 3580. [2025-03-08 15:47:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3580 states, 3096 states have (on average 1.5733204134366925) internal successors, (4871), 3096 states have internal predecessors, (4871), 476 states have call successors, (476), 7 states have call predecessors, (476), 7 states have return successors, (476), 476 states have call predecessors, (476), 476 states have call successors, (476) [2025-03-08 15:47:48,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5823 transitions. [2025-03-08 15:47:48,773 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5823 transitions. Word has length 479 [2025-03-08 15:47:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:48,774 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5823 transitions. [2025-03-08 15:47:48,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:48,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5823 transitions. [2025-03-08 15:47:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-08 15:47:48,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:48,779 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:48,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:47:48,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:48,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:48,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1091838260, now seen corresponding path program 1 times [2025-03-08 15:47:48,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:48,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89487259] [2025-03-08 15:47:48,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:48,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:48,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-08 15:47:49,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-08 15:47:49,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:49,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89487259] [2025-03-08 15:47:49,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89487259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:49,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758309218] [2025-03-08 15:47:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:49,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:49,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:49,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:49,832 INFO L87 Difference]: Start difference. First operand 3580 states and 5823 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:50,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:50,296 INFO L93 Difference]: Finished difference Result 10730 states and 17467 transitions. [2025-03-08 15:47:50,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-08 15:47:50,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:50,329 INFO L225 Difference]: With dead ends: 10730 [2025-03-08 15:47:50,330 INFO L226 Difference]: Without dead ends: 7482 [2025-03-08 15:47:50,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03-08 15:47:50,338 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 1049 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:50,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1506 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:47:50,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2025-03-08 15:47:50,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6679. [2025-03-08 15:47:50,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6679 states, 5954 states have (on average 1.5848169297950958) internal successors, (9436), 5960 states have internal predecessors, (9436), 710 states have call successors, (710), 14 states have call predecessors, (710), 14 states have return successors, (710), 704 states have call predecessors, (710), 710 states have call successors, (710) [2025-03-08 15:47:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 10856 transitions. [2025-03-08 15:47:50,597 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 10856 transitions. Word has length 479 [2025-03-08 15:47:50,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:50,597 INFO L471 AbstractCegarLoop]: Abstraction has 6679 states and 10856 transitions. [2025-03-08 15:47:50,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:50,598 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 10856 transitions. [2025-03-08 15:47:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-08 15:47:50,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:50,604 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:47:50,605 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:50,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash -137609365, now seen corresponding path program 1 times [2025-03-08 15:47:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:50,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306474530] [2025-03-08 15:47:50,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:50,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-08 15:47:50,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-08 15:47:50,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:50,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:51,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:51,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:51,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306474530] [2025-03-08 15:47:51,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306474530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:51,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:51,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:47:51,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57171291] [2025-03-08 15:47:51,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:51,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:47:51,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:51,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:47:51,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:47:51,416 INFO L87 Difference]: Start difference. First operand 6679 states and 10856 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:52,197 INFO L93 Difference]: Finished difference Result 17715 states and 28757 transitions. [2025-03-08 15:47:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:47:52,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-08 15:47:52,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:52,256 INFO L225 Difference]: With dead ends: 17715 [2025-03-08 15:47:52,256 INFO L226 Difference]: Without dead ends: 12311 [2025-03-08 15:47:52,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-08 15:47:52,271 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1056 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:52,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 1217 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:47:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12311 states. [2025-03-08 15:47:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12311 to 7439. [2025-03-08 15:47:52,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7439 states, 6714 states have (on average 1.588173964849568) internal successors, (10663), 6720 states have internal predecessors, (10663), 710 states have call successors, (710), 14 states have call predecessors, (710), 14 states have return successors, (710), 704 states have call predecessors, (710), 710 states have call successors, (710) [2025-03-08 15:47:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7439 states to 7439 states and 12083 transitions. [2025-03-08 15:47:52,573 INFO L78 Accepts]: Start accepts. Automaton has 7439 states and 12083 transitions. Word has length 479 [2025-03-08 15:47:52,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:52,574 INFO L471 AbstractCegarLoop]: Abstraction has 7439 states and 12083 transitions. [2025-03-08 15:47:52,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:52,575 INFO L276 IsEmpty]: Start isEmpty. Operand 7439 states and 12083 transitions. [2025-03-08 15:47:52,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-08 15:47:52,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:52,580 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:52,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:47:52,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash -375992818, now seen corresponding path program 1 times [2025-03-08 15:47:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:52,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962896791] [2025-03-08 15:47:52,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:52,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-08 15:47:52,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-08 15:47:52,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:52,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:52,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:47:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962896791] [2025-03-08 15:47:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962896791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:47:52,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:47:52,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:47:52,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179364726] [2025-03-08 15:47:52,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:47:52,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:47:52,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:52,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:47:52,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:47:52,808 INFO L87 Difference]: Start difference. First operand 7439 states and 12083 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:53,122 INFO L93 Difference]: Finished difference Result 11040 states and 17921 transitions. [2025-03-08 15:47:53,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:47:53,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 479 [2025-03-08 15:47:53,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:53,149 INFO L225 Difference]: With dead ends: 11040 [2025-03-08 15:47:53,149 INFO L226 Difference]: Without dead ends: 7453 [2025-03-08 15:47:53,160 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-03-08 15:47:53,161 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 447 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:53,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1066 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:47:53,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-03-08 15:47:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 5114. [2025-03-08 15:47:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 4607 states have (on average 1.5836770132407207) internal successors, (7296), 4611 states have internal predecessors, (7296), 496 states have call successors, (496), 10 states have call predecessors, (496), 10 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-08 15:47:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 8288 transitions. [2025-03-08 15:47:53,437 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 8288 transitions. Word has length 479 [2025-03-08 15:47:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 8288 transitions. [2025-03-08 15:47:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:47:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 8288 transitions. [2025-03-08 15:47:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-08 15:47:53,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:53,444 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:53,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 15:47:53,445 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1836522913, now seen corresponding path program 1 times [2025-03-08 15:47:53,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:53,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676653233] [2025-03-08 15:47:53,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:53,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:53,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-08 15:47:54,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-08 15:47:54,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:54,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:55,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 81 proven. 120 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:47:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676653233] [2025-03-08 15:47:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676653233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680004196] [2025-03-08 15:47:55,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:55,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:55,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:55,026 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:55,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:47:55,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-08 15:47:55,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-08 15:47:55,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:55,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:55,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:55,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4441 proven. 120 refuted. 0 times theorem prover too weak. 4551 trivial. 0 not checked. [2025-03-08 15:47:55,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 81 proven. 120 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:47:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680004196] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:56,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:56,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 15:47:56,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341936683] [2025-03-08 15:47:56,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:56,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 15:47:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:56,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 15:47:56,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:47:56,128 INFO L87 Difference]: Start difference. First operand 5114 states and 8288 transitions. Second operand has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) [2025-03-08 15:47:56,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:47:56,626 INFO L93 Difference]: Finished difference Result 10133 states and 16391 transitions. [2025-03-08 15:47:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 15:47:56,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) Word has length 480 [2025-03-08 15:47:56,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:47:56,642 INFO L225 Difference]: With dead ends: 10133 [2025-03-08 15:47:56,643 INFO L226 Difference]: Without dead ends: 5170 [2025-03-08 15:47:56,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 966 GetRequests, 957 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:47:56,653 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 698 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:47:56,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1047 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:47:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2025-03-08 15:47:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 5150. [2025-03-08 15:47:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5150 states, 4634 states have (on average 1.5763918860595598) internal successors, (7305), 4638 states have internal predecessors, (7305), 496 states have call successors, (496), 19 states have call predecessors, (496), 19 states have return successors, (496), 492 states have call predecessors, (496), 496 states have call successors, (496) [2025-03-08 15:47:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 8297 transitions. [2025-03-08 15:47:56,849 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 8297 transitions. Word has length 480 [2025-03-08 15:47:56,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:47:56,851 INFO L471 AbstractCegarLoop]: Abstraction has 5150 states and 8297 transitions. [2025-03-08 15:47:56,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.625) internal successors, (189), 8 states have internal predecessors, (189), 3 states have call successors, (148), 2 states have call predecessors, (148), 4 states have return successors, (149), 3 states have call predecessors, (149), 3 states have call successors, (149) [2025-03-08 15:47:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 8297 transitions. [2025-03-08 15:47:56,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-08 15:47:56,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:47:56,856 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:47:56,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:47:57,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:57,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:47:57,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:47:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash 250075369, now seen corresponding path program 1 times [2025-03-08 15:47:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:47:57,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370709036] [2025-03-08 15:47:57,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:47:57,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-08 15:47:57,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-08 15:47:57,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:57,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 81 proven. 120 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:47:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:47:58,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370709036] [2025-03-08 15:47:58,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370709036] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:47:58,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613628368] [2025-03-08 15:47:58,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:47:58,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:47:58,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:47:58,195 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:47:58,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:47:58,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-08 15:47:58,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-08 15:47:58,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:47:58,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:47:58,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:47:58,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:47:58,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4513 proven. 84 refuted. 0 times theorem prover too weak. 4515 trivial. 0 not checked. [2025-03-08 15:47:58,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:47:59,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 117 proven. 84 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:47:59,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613628368] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:47:59,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:47:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-08 15:47:59,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697232141] [2025-03-08 15:47:59,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:47:59,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 15:47:59,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:47:59,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 15:47:59,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:47:59,177 INFO L87 Difference]: Start difference. First operand 5150 states and 8297 transitions. Second operand has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) [2025-03-08 15:48:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:00,306 INFO L93 Difference]: Finished difference Result 7990 states and 12802 transitions. [2025-03-08 15:48:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 15:48:00,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) Word has length 481 [2025-03-08 15:48:00,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:00,316 INFO L225 Difference]: With dead ends: 7990 [2025-03-08 15:48:00,316 INFO L226 Difference]: Without dead ends: 2923 [2025-03-08 15:48:00,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 960 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2025-03-08 15:48:00,324 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 2638 mSDsluCounter, 1451 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2677 SdHoareTripleChecker+Valid, 1896 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:00,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2677 Valid, 1896 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 15:48:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2025-03-08 15:48:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2558. [2025-03-08 15:48:00,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2197 states have (on average 1.5339098771051434) internal successors, (3370), 2197 states have internal predecessors, (3370), 340 states have call successors, (340), 20 states have call predecessors, (340), 20 states have return successors, (340), 340 states have call predecessors, (340), 340 states have call successors, (340) [2025-03-08 15:48:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4050 transitions. [2025-03-08 15:48:00,450 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4050 transitions. Word has length 481 [2025-03-08 15:48:00,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:00,451 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4050 transitions. [2025-03-08 15:48:00,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 22.5) internal successors, (225), 10 states have internal predecessors, (225), 4 states have call successors, (164), 2 states have call predecessors, (164), 4 states have return successors, (165), 4 states have call predecessors, (165), 4 states have call successors, (165) [2025-03-08 15:48:00,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4050 transitions. [2025-03-08 15:48:00,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-08 15:48:00,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:00,455 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:00,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:48:00,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:00,656 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:00,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1084690438, now seen corresponding path program 1 times [2025-03-08 15:48:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931667025] [2025-03-08 15:48:00,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:00,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-08 15:48:00,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-08 15:48:00,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:00,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:48:00,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:00,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931667025] [2025-03-08 15:48:00,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931667025] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:00,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:00,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:48:00,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348324762] [2025-03-08 15:48:00,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:00,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:48:00,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:00,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:48:00,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:48:00,806 INFO L87 Difference]: Start difference. First operand 2558 states and 4050 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:48:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:00,973 INFO L93 Difference]: Finished difference Result 7104 states and 11278 transitions. [2025-03-08 15:48:00,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:48:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 482 [2025-03-08 15:48:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:00,988 INFO L225 Difference]: With dead ends: 7104 [2025-03-08 15:48:00,988 INFO L226 Difference]: Without dead ends: 4863 [2025-03-08 15:48:00,993 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-03-08 15:48:00,994 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 495 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:00,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 961 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:48:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2025-03-08 15:48:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 2852. [2025-03-08 15:48:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2852 states, 2491 states have (on average 1.5367322360497793) internal successors, (3828), 2491 states have internal predecessors, (3828), 340 states have call successors, (340), 20 states have call predecessors, (340), 20 states have return successors, (340), 340 states have call predecessors, (340), 340 states have call successors, (340) [2025-03-08 15:48:01,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4508 transitions. [2025-03-08 15:48:01,108 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4508 transitions. Word has length 482 [2025-03-08 15:48:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:01,108 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4508 transitions. [2025-03-08 15:48:01,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:48:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4508 transitions. [2025-03-08 15:48:01,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-08 15:48:01,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:01,113 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:01,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:48:01,113 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:01,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1185602405, now seen corresponding path program 1 times [2025-03-08 15:48:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343942615] [2025-03-08 15:48:01,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:01,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-08 15:48:01,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-08 15:48:01,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:01,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-03-08 15:48:01,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:01,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343942615] [2025-03-08 15:48:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343942615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:48:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:48:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:48:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120953371] [2025-03-08 15:48:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:48:01,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:48:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:01,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:48:01,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:48:01,633 INFO L87 Difference]: Start difference. First operand 2852 states and 4508 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:48:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:02,101 INFO L93 Difference]: Finished difference Result 9609 states and 15256 transitions. [2025-03-08 15:48:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:48:02,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 482 [2025-03-08 15:48:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:02,117 INFO L225 Difference]: With dead ends: 9609 [2025-03-08 15:48:02,117 INFO L226 Difference]: Without dead ends: 6974 [2025-03-08 15:48:02,122 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-03-08 15:48:02,124 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1379 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1379 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:02,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1379 Valid, 1923 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:48:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-03-08 15:48:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6799. [2025-03-08 15:48:02,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6799 states, 6155 states have (on average 1.5520714865962633) internal successors, (9553), 6161 states have internal predecessors, (9553), 608 states have call successors, (608), 35 states have call predecessors, (608), 35 states have return successors, (608), 602 states have call predecessors, (608), 608 states have call successors, (608) [2025-03-08 15:48:02,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 10769 transitions. [2025-03-08 15:48:02,447 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 10769 transitions. Word has length 482 [2025-03-08 15:48:02,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:02,447 INFO L471 AbstractCegarLoop]: Abstraction has 6799 states and 10769 transitions. [2025-03-08 15:48:02,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-03-08 15:48:02,448 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 10769 transitions. [2025-03-08 15:48:02,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-08 15:48:02,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:02,453 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:02,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:48:02,453 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:02,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:02,454 INFO L85 PathProgramCache]: Analyzing trace with hash -905252516, now seen corresponding path program 1 times [2025-03-08 15:48:02,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:02,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827193314] [2025-03-08 15:48:02,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:02,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:02,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-08 15:48:02,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-08 15:48:02,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:02,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 180 proven. 21 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:48:03,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827193314] [2025-03-08 15:48:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827193314] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200409712] [2025-03-08 15:48:03,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:03,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:03,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:03,450 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:03,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:48:03,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-08 15:48:03,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-08 15:48:03,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:03,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:03,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:48:03,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 3745 proven. 339 refuted. 0 times theorem prover too weak. 5028 trivial. 0 not checked. [2025-03-08 15:48:05,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:48:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200409712] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:06,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:48:06,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2025-03-08 15:48:06,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659096250] [2025-03-08 15:48:06,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:48:06,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 15:48:06,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:06,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 15:48:06,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:48:06,246 INFO L87 Difference]: Start difference. First operand 6799 states and 10769 transitions. Second operand has 12 states, 12 states have (on average 20.25) internal successors, (243), 12 states have internal predecessors, (243), 5 states have call successors, (133), 4 states have call predecessors, (133), 6 states have return successors, (134), 5 states have call predecessors, (134), 5 states have call successors, (134) [2025-03-08 15:48:08,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:08,708 INFO L93 Difference]: Finished difference Result 19583 states and 30729 transitions. [2025-03-08 15:48:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-08 15:48:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 20.25) internal successors, (243), 12 states have internal predecessors, (243), 5 states have call successors, (133), 4 states have call predecessors, (133), 6 states have return successors, (134), 5 states have call predecessors, (134), 5 states have call successors, (134) Word has length 482 [2025-03-08 15:48:08,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:08,737 INFO L225 Difference]: With dead ends: 19583 [2025-03-08 15:48:08,738 INFO L226 Difference]: Without dead ends: 13281 [2025-03-08 15:48:08,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 910 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=544, Invalid=1526, Unknown=0, NotChecked=0, Total=2070 [2025-03-08 15:48:08,749 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1436 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:08,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 2080 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 15:48:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13281 states. [2025-03-08 15:48:09,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13281 to 13183. [2025-03-08 15:48:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13183 states, 11935 states have (on average 1.513531629660662) internal successors, (18064), 11953 states have internal predecessors, (18064), 1100 states have call successors, (1100), 147 states have call predecessors, (1100), 147 states have return successors, (1100), 1082 states have call predecessors, (1100), 1100 states have call successors, (1100) [2025-03-08 15:48:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13183 states to 13183 states and 20264 transitions. [2025-03-08 15:48:09,197 INFO L78 Accepts]: Start accepts. Automaton has 13183 states and 20264 transitions. Word has length 482 [2025-03-08 15:48:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:09,198 INFO L471 AbstractCegarLoop]: Abstraction has 13183 states and 20264 transitions. [2025-03-08 15:48:09,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.25) internal successors, (243), 12 states have internal predecessors, (243), 5 states have call successors, (133), 4 states have call predecessors, (133), 6 states have return successors, (134), 5 states have call predecessors, (134), 5 states have call successors, (134) [2025-03-08 15:48:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 13183 states and 20264 transitions. [2025-03-08 15:48:09,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:48:09,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:09,206 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:09,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 15:48:09,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 15:48:09,411 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:09,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:09,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1433797229, now seen corresponding path program 1 times [2025-03-08 15:48:09,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241769278] [2025-03-08 15:48:09,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:09,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:09,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:48:09,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:48:09,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:09,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 30 proven. 171 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-03-08 15:48:10,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241769278] [2025-03-08 15:48:10,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241769278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:10,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970067079] [2025-03-08 15:48:10,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:10,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:10,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:10,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:10,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 15:48:10,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:48:10,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:48:10,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:10,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:10,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-08 15:48:10,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 6001 proven. 246 refuted. 0 times theorem prover too weak. 2865 trivial. 0 not checked. [2025-03-08 15:48:11,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:48:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 699 proven. 276 refuted. 0 times theorem prover too weak. 8137 trivial. 0 not checked. [2025-03-08 15:48:13,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970067079] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:48:13,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:48:13,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 18] total 40 [2025-03-08 15:48:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788735465] [2025-03-08 15:48:13,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:48:13,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 15:48:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:13,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 15:48:13,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 15:48:13,694 INFO L87 Difference]: Start difference. First operand 13183 states and 20264 transitions. Second operand has 40 states, 38 states have (on average 8.552631578947368) internal successors, (325), 38 states have internal predecessors, (325), 14 states have call successors, (178), 6 states have call predecessors, (178), 15 states have return successors, (179), 13 states have call predecessors, (179), 14 states have call successors, (179) [2025-03-08 15:48:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:19,365 INFO L93 Difference]: Finished difference Result 58485 states and 89602 transitions. [2025-03-08 15:48:19,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-08 15:48:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 8.552631578947368) internal successors, (325), 38 states have internal predecessors, (325), 14 states have call successors, (178), 6 states have call predecessors, (178), 15 states have return successors, (179), 13 states have call predecessors, (179), 14 states have call successors, (179) Word has length 484 [2025-03-08 15:48:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:19,452 INFO L225 Difference]: With dead ends: 58485 [2025-03-08 15:48:19,452 INFO L226 Difference]: Without dead ends: 45523 [2025-03-08 15:48:19,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2357, Invalid=6955, Unknown=0, NotChecked=0, Total=9312 [2025-03-08 15:48:19,479 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 10801 mSDsluCounter, 4740 mSDsCounter, 0 mSdLazyCounter, 4160 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10809 SdHoareTripleChecker+Valid, 5308 SdHoareTripleChecker+Invalid, 5041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 881 IncrementalHoareTripleChecker+Valid, 4160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:19,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10809 Valid, 5308 Invalid, 5041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [881 Valid, 4160 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 15:48:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45523 states. [2025-03-08 15:48:20,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45523 to 14859. [2025-03-08 15:48:20,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14859 states, 14089 states have (on average 1.5140890056072114) internal successors, (21332), 14095 states have internal predecessors, (21332), 608 states have call successors, (608), 161 states have call predecessors, (608), 161 states have return successors, (608), 602 states have call predecessors, (608), 608 states have call successors, (608) [2025-03-08 15:48:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14859 states to 14859 states and 22548 transitions. [2025-03-08 15:48:20,207 INFO L78 Accepts]: Start accepts. Automaton has 14859 states and 22548 transitions. Word has length 484 [2025-03-08 15:48:20,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:20,207 INFO L471 AbstractCegarLoop]: Abstraction has 14859 states and 22548 transitions. [2025-03-08 15:48:20,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 8.552631578947368) internal successors, (325), 38 states have internal predecessors, (325), 14 states have call successors, (178), 6 states have call predecessors, (178), 15 states have return successors, (179), 13 states have call predecessors, (179), 14 states have call successors, (179) [2025-03-08 15:48:20,208 INFO L276 IsEmpty]: Start isEmpty. Operand 14859 states and 22548 transitions. [2025-03-08 15:48:20,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:48:20,216 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:20,216 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:20,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 15:48:20,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:48:20,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:20,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:20,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1313677356, now seen corresponding path program 1 times [2025-03-08 15:48:20,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:20,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281276566] [2025-03-08 15:48:20,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:20,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:48:22,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:48:22,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:24,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 33 proven. 363 refuted. 0 times theorem prover too weak. 8716 trivial. 0 not checked. [2025-03-08 15:48:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281276566] [2025-03-08 15:48:24,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281276566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:24,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718741959] [2025-03-08 15:48:24,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:24,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:24,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:24,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:24,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 15:48:24,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:48:25,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:48:25,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:25,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:25,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-08 15:48:25,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:48:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 5023 proven. 840 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2025-03-08 15:48:29,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:48:31,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718741959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:31,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:48:31,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24] total 33 [2025-03-08 15:48:31,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451154767] [2025-03-08 15:48:31,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:48:31,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-08 15:48:31,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:48:31,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-08 15:48:31,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1275, Unknown=0, NotChecked=0, Total=1482 [2025-03-08 15:48:31,274 INFO L87 Difference]: Start difference. First operand 14859 states and 22548 transitions. Second operand has 33 states, 32 states have (on average 8.71875) internal successors, (279), 31 states have internal predecessors, (279), 12 states have call successors, (133), 7 states have call predecessors, (133), 11 states have return successors, (134), 11 states have call predecessors, (134), 12 states have call successors, (134) [2025-03-08 15:48:41,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:48:41,582 INFO L93 Difference]: Finished difference Result 72479 states and 112318 transitions. [2025-03-08 15:48:41,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-08 15:48:41,583 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 8.71875) internal successors, (279), 31 states have internal predecessors, (279), 12 states have call successors, (133), 7 states have call predecessors, (133), 11 states have return successors, (134), 11 states have call predecessors, (134), 12 states have call successors, (134) Word has length 484 [2025-03-08 15:48:41,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:48:41,689 INFO L225 Difference]: With dead ends: 72479 [2025-03-08 15:48:41,689 INFO L226 Difference]: Without dead ends: 59685 [2025-03-08 15:48:41,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 685 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2761 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2267, Invalid=8863, Unknown=0, NotChecked=0, Total=11130 [2025-03-08 15:48:41,717 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 14953 mSDsluCounter, 4863 mSDsCounter, 0 mSdLazyCounter, 4648 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14954 SdHoareTripleChecker+Valid, 5429 SdHoareTripleChecker+Invalid, 5368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 720 IncrementalHoareTripleChecker+Valid, 4648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:48:41,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14954 Valid, 5429 Invalid, 5368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [720 Valid, 4648 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-08 15:48:41,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59685 states. [2025-03-08 15:48:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59685 to 15851. [2025-03-08 15:48:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15851 states, 15035 states have (on average 1.521383438643166) internal successors, (22874), 15041 states have internal predecessors, (22874), 608 states have call successors, (608), 207 states have call predecessors, (608), 207 states have return successors, (608), 602 states have call predecessors, (608), 608 states have call successors, (608) [2025-03-08 15:48:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 24090 transitions. [2025-03-08 15:48:42,671 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 24090 transitions. Word has length 484 [2025-03-08 15:48:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:48:42,672 INFO L471 AbstractCegarLoop]: Abstraction has 15851 states and 24090 transitions. [2025-03-08 15:48:42,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 8.71875) internal successors, (279), 31 states have internal predecessors, (279), 12 states have call successors, (133), 7 states have call predecessors, (133), 11 states have return successors, (134), 11 states have call predecessors, (134), 12 states have call successors, (134) [2025-03-08 15:48:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 24090 transitions. [2025-03-08 15:48:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:48:42,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:48:42,679 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:48:42,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 15:48:42,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:42,880 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:48:42,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:48:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -544507341, now seen corresponding path program 1 times [2025-03-08 15:48:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:48:42,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181047867] [2025-03-08 15:48:42,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:42,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:48:42,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:48:43,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:48:43,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:43,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 99 proven. 297 refuted. 0 times theorem prover too weak. 8716 trivial. 0 not checked. [2025-03-08 15:48:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:48:44,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181047867] [2025-03-08 15:48:44,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181047867] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:48:44,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166835894] [2025-03-08 15:48:44,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:48:44,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:48:44,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:48:44,768 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:48:44,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 15:48:44,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:48:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:48:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:48:45,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:48:45,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 15:48:45,472 INFO L279 TraceCheckSpWp]: Computing forward predicates...