./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 798a7b37 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-?-798a7b3-m [2025-03-04 00:36:22,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:36:22,629 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:36:22,633 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:36:22,634 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:36:22,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:36:22,658 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:36:22,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:36:22,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:36:22,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:36:22,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:36:22,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:36:22,660 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:36:22,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:36:22,660 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:36:22,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:36:22,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:36:22,660 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:36:22,661 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:36:22,662 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:36:22,662 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:36:22,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:36:22,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:36:22,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:36:22,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:22,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:36:22,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:36:22,663 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-04 00:36:22,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:36:22,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:36:22,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:36:22,891 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:36:22,891 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:36:22,892 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-04 00:36:23,981 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d84bc0/0b7d78d9e4a34d9394b3dd912bdf399c/FLAG8a87c1fc7 [2025-03-04 00:36:24,254 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:36:24,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-78.i [2025-03-04 00:36:24,272 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d84bc0/0b7d78d9e4a34d9394b3dd912bdf399c/FLAG8a87c1fc7 [2025-03-04 00:36:24,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c96d84bc0/0b7d78d9e4a34d9394b3dd912bdf399c [2025-03-04 00:36:24,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:36:24,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:36:24,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:24,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:36:24,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:36:24,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:24" (1/1) ... [2025-03-04 00:36:24,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7383bcc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:24, skipping insertion in model container [2025-03-04 00:36:24,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:36:24" (1/1) ... [2025-03-04 00:36:24,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:36:24,686 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-04 00:36:24,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:24,915 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:36:24,923 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-04 00:36:25,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:36:25,044 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:36:25,045 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25 WrapperNode [2025-03-04 00:36:25,045 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:36:25,046 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:25,046 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:36:25,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:36:25,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,149 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 807 [2025-03-04 00:36:25,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:36:25,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:36:25,151 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:36:25,151 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:36:25,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,250 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-04 00:36:25,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,251 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,283 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,306 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:36:25,333 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:36:25,333 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:36:25,334 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:36:25,335 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (1/1) ... [2025-03-04 00:36:25,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:36:25,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:25,362 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-04 00:36:25,366 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-04 00:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:36:25,381 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:36:25,382 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:36:25,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:36:25,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:36:25,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:36:25,490 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:36:26,426 INFO L1325 $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-04 00:36:26,552 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2025-03-04 00:36:26,552 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:36:26,587 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:36:26,587 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:36:26,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:26 BoogieIcfgContainer [2025-03-04 00:36:26,590 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:36:26,592 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:36:26,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:36:26,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:36:26,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:36:24" (1/3) ... [2025-03-04 00:36:26,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bedff02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:26, skipping insertion in model container [2025-03-04 00:36:26,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:36:25" (2/3) ... [2025-03-04 00:36:26,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bedff02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:36:26, skipping insertion in model container [2025-03-04 00:36:26,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:36:26" (3/3) ... [2025-03-04 00:36:26,600 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-78.i [2025-03-04 00:36:26,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:36:26,615 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-04 00:36:26,675 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:36:26,685 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;@2c296601, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:36:26,686 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:36:26,691 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-04 00:36:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:36:26,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:26,732 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-04 00:36:26,733 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:26,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1246865255, now seen corresponding path program 1 times [2025-03-04 00:36:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:26,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333755629] [2025-03-04 00:36:26,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:26,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:26,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:36:26,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:36:26,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:26,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:27,269 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-04 00:36:27,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:27,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333755629] [2025-03-04 00:36:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333755629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:27,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331372562] [2025-03-04 00:36:27,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:27,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:27,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:27,273 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-04 00:36:27,274 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-04 00:36:27,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:36:27,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:36:27,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:27,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:27,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:36:27,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:27,686 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-04 00:36:27,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:36:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331372562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:36:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:36:27,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529507166] [2025-03-04 00:36:27,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:27,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:36:27,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:27,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:36:27,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:36:27,720 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-04 00:36:27,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:27,824 INFO L93 Difference]: Finished difference Result 634 states and 1101 transitions. [2025-03-04 00:36:27,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:36:27,826 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-04 00:36:27,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:27,837 INFO L225 Difference]: With dead ends: 634 [2025-03-04 00:36:27,837 INFO L226 Difference]: Without dead ends: 317 [2025-03-04 00:36:27,843 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-04 00:36:27,847 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:27,850 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.0s Time] [2025-03-04 00:36:27,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-03-04 00:36:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2025-03-04 00:36:27,913 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-04 00:36:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 514 transitions. [2025-03-04 00:36:27,926 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 514 transitions. Word has length 477 [2025-03-04 00:36:27,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:27,928 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 514 transitions. [2025-03-04 00:36:27,929 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-04 00:36:27,929 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 514 transitions. [2025-03-04 00:36:27,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-04 00:36:27,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:27,941 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-04 00:36:27,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 00:36:28,145 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-04 00:36:28,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:28,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1332960611, now seen corresponding path program 1 times [2025-03-04 00:36:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:28,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223246898] [2025-03-04 00:36:28,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:28,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:36:28,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:36:28,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:28,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:29,104 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-04 00:36:29,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:29,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223246898] [2025-03-04 00:36:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223246898] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:29,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988946003] [2025-03-04 00:36:29,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:29,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:29,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:29,108 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-04 00:36:29,109 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-04 00:36:29,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-04 00:36:29,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-04 00:36:29,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:29,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:29,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 00:36:29,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:29,895 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-04 00:36:29,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:36:29,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988946003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:29,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:36:29,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-03-04 00:36:29,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342472012] [2025-03-04 00:36:29,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:29,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:29,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:29,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:29,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 00:36:29,902 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-04 00:36:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:30,216 INFO L93 Difference]: Finished difference Result 946 states and 1537 transitions. [2025-03-04 00:36:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:30,216 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-04 00:36:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:30,222 INFO L225 Difference]: With dead ends: 946 [2025-03-04 00:36:30,222 INFO L226 Difference]: Without dead ends: 632 [2025-03-04 00:36:30,223 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-04 00:36:30,227 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:30,227 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.3s Time] [2025-03-04 00:36:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2025-03-04 00:36:30,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 595. [2025-03-04 00:36:30,297 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-04 00:36:30,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 972 transitions. [2025-03-04 00:36:30,301 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 972 transitions. Word has length 477 [2025-03-04 00:36:30,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:30,302 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 972 transitions. [2025-03-04 00:36:30,302 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-04 00:36:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 972 transitions. [2025-03-04 00:36:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:36:30,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:30,307 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-04 00:36:30,315 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-04 00:36:30,507 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-04 00:36:30,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:30,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:30,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1681560350, now seen corresponding path program 1 times [2025-03-04 00:36:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:30,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972003833] [2025-03-04 00:36:30,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:30,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:30,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:36:30,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:36:30,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:30,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:30,763 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-04 00:36:30,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972003833] [2025-03-04 00:36:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972003833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:30,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:30,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333102703] [2025-03-04 00:36:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:30,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:30,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:30,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:30,765 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-04 00:36:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:30,907 INFO L93 Difference]: Finished difference Result 1425 states and 2336 transitions. [2025-03-04 00:36:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:30,907 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-04 00:36:30,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:30,918 INFO L225 Difference]: With dead ends: 1425 [2025-03-04 00:36:30,918 INFO L226 Difference]: Without dead ends: 995 [2025-03-04 00:36:30,919 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-04 00:36:30,923 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-04 00:36:30,923 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-04 00:36:30,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2025-03-04 00:36:30,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 829. [2025-03-04 00:36:30,977 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-04 00:36:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1360 transitions. [2025-03-04 00:36:30,982 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1360 transitions. Word has length 478 [2025-03-04 00:36:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1360 transitions. [2025-03-04 00:36:30,983 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-04 00:36:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1360 transitions. [2025-03-04 00:36:30,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:36:30,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:30,988 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-04 00:36:30,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:36:30,989 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:30,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:30,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1110309117, now seen corresponding path program 1 times [2025-03-04 00:36:30,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:30,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274828390] [2025-03-04 00:36:30,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:31,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:36:31,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:36:31,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:31,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:31,244 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-04 00:36:31,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:31,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274828390] [2025-03-04 00:36:31,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274828390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:31,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:31,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419182560] [2025-03-04 00:36:31,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:31,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:31,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:31,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:31,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:31,247 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-04 00:36:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:31,393 INFO L93 Difference]: Finished difference Result 2026 states and 3324 transitions. [2025-03-04 00:36:31,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:31,394 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-04 00:36:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:31,405 INFO L225 Difference]: With dead ends: 2026 [2025-03-04 00:36:31,405 INFO L226 Difference]: Without dead ends: 1519 [2025-03-04 00:36:31,410 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-04 00:36:31,410 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-04 00:36:31,410 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-04 00:36:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2025-03-04 00:36:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1515. [2025-03-04 00:36:31,492 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-04 00:36:31,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 2489 transitions. [2025-03-04 00:36:31,501 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 2489 transitions. Word has length 478 [2025-03-04 00:36:31,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:31,504 INFO L471 AbstractCegarLoop]: Abstraction has 1515 states and 2489 transitions. [2025-03-04 00:36:31,505 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-04 00:36:31,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2489 transitions. [2025-03-04 00:36:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-03-04 00:36:31,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:31,512 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-04 00:36:31,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 00:36:31,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:31,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:31,513 INFO L85 PathProgramCache]: Analyzing trace with hash -134455364, now seen corresponding path program 1 times [2025-03-04 00:36:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398123635] [2025-03-04 00:36:31,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:31,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-03-04 00:36:31,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-03-04 00:36:31,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:31,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:32,216 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-04 00:36:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:32,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398123635] [2025-03-04 00:36:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398123635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:32,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:32,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:32,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587325132] [2025-03-04 00:36:32,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:32,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:32,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:32,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:32,218 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-04 00:36:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:32,367 INFO L93 Difference]: Finished difference Result 3323 states and 5464 transitions. [2025-03-04 00:36:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:32,368 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-04 00:36:32,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:32,378 INFO L225 Difference]: With dead ends: 3323 [2025-03-04 00:36:32,378 INFO L226 Difference]: Without dead ends: 2206 [2025-03-04 00:36:32,382 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-04 00:36:32,382 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-04 00:36:32,383 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-04 00:36:32,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2025-03-04 00:36:32,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2202. [2025-03-04 00:36:32,476 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-04 00:36:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 3614 transitions. [2025-03-04 00:36:32,489 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 3614 transitions. Word has length 478 [2025-03-04 00:36:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:32,490 INFO L471 AbstractCegarLoop]: Abstraction has 2202 states and 3614 transitions. [2025-03-04 00:36:32,490 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-04 00:36:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 3614 transitions. [2025-03-04 00:36:32,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:36:32,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:32,497 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-04 00:36:32,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 00:36:32,497 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:32,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:32,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1539986198, now seen corresponding path program 1 times [2025-03-04 00:36:32,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:32,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527674644] [2025-03-04 00:36:32,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:32,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:32,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:36:32,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:36:32,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:33,089 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-04 00:36:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:33,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527674644] [2025-03-04 00:36:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527674644] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:33,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195481171] [2025-03-04 00:36:33,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:33,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:33,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:33,092 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-04 00:36:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:33,254 INFO L93 Difference]: Finished difference Result 5507 states and 9024 transitions. [2025-03-04 00:36:33,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:33,255 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-04 00:36:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:33,272 INFO L225 Difference]: With dead ends: 5507 [2025-03-04 00:36:33,272 INFO L226 Difference]: Without dead ends: 3661 [2025-03-04 00:36:33,277 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-04 00:36:33,278 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-04 00:36:33,278 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-04 00:36:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2025-03-04 00:36:33,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 3584. [2025-03-04 00:36:33,436 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-04 00:36:33,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 5835 transitions. [2025-03-04 00:36:33,453 INFO L78 Accepts]: Start accepts. Automaton has 3584 states and 5835 transitions. Word has length 479 [2025-03-04 00:36:33,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:33,453 INFO L471 AbstractCegarLoop]: Abstraction has 3584 states and 5835 transitions. [2025-03-04 00:36:33,454 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-04 00:36:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 3584 states and 5835 transitions. [2025-03-04 00:36:33,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:36:33,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:33,460 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-04 00:36:33,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 00:36:33,460 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1259636309, now seen corresponding path program 1 times [2025-03-04 00:36:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576785748] [2025-03-04 00:36:33,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:33,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:33,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:36:33,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:36:33,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:33,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:34,474 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-04 00:36:34,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:34,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576785748] [2025-03-04 00:36:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576785748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:34,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:34,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:34,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138062371] [2025-03-04 00:36:34,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:34,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:34,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:34,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:34,477 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-04 00:36:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:34,939 INFO L93 Difference]: Finished difference Result 8035 states and 13093 transitions. [2025-03-04 00:36:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:34,940 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-04 00:36:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:34,963 INFO L225 Difference]: With dead ends: 8035 [2025-03-04 00:36:34,963 INFO L226 Difference]: Without dead ends: 4576 [2025-03-04 00:36:34,973 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-04 00:36:34,974 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1004 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-04 00:36:34,974 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-04 00:36:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4576 states. [2025-03-04 00:36:35,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4576 to 3580. [2025-03-04 00:36:35,147 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-04 00:36:35,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 5823 transitions. [2025-03-04 00:36:35,164 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 5823 transitions. Word has length 479 [2025-03-04 00:36:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:35,166 INFO L471 AbstractCegarLoop]: Abstraction has 3580 states and 5823 transitions. [2025-03-04 00:36:35,166 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-04 00:36:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 5823 transitions. [2025-03-04 00:36:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:36:35,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:35,174 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-04 00:36:35,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 00:36:35,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:35,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1091838260, now seen corresponding path program 1 times [2025-03-04 00:36:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812530990] [2025-03-04 00:36:35,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:35,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:35,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:36:35,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:36:35,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:35,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:36,181 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-04 00:36:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812530990] [2025-03-04 00:36:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812530990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166156513] [2025-03-04 00:36:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:36,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:36,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:36,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:36,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:36,183 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-04 00:36:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:36,620 INFO L93 Difference]: Finished difference Result 10730 states and 17467 transitions. [2025-03-04 00:36:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:36,620 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-04 00:36:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:36,654 INFO L225 Difference]: With dead ends: 10730 [2025-03-04 00:36:36,654 INFO L226 Difference]: Without dead ends: 7482 [2025-03-04 00:36:36,664 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-04 00:36:36,665 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-04 00:36:36,666 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-04 00:36:36,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7482 states. [2025-03-04 00:36:36,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7482 to 6679. [2025-03-04 00:36:36,954 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-04 00:36:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6679 states to 6679 states and 10856 transitions. [2025-03-04 00:36:36,986 INFO L78 Accepts]: Start accepts. Automaton has 6679 states and 10856 transitions. Word has length 479 [2025-03-04 00:36:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:36,987 INFO L471 AbstractCegarLoop]: Abstraction has 6679 states and 10856 transitions. [2025-03-04 00:36:36,987 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-04 00:36:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 6679 states and 10856 transitions. [2025-03-04 00:36:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:36:36,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:36,996 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-04 00:36:36,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 00:36:36,997 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:36,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:36,997 INFO L85 PathProgramCache]: Analyzing trace with hash -137609365, now seen corresponding path program 1 times [2025-03-04 00:36:36,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:36,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063617810] [2025-03-04 00:36:36,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:36,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:37,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:36:37,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:36:37,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:37,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:37,861 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-04 00:36:37,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:37,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063617810] [2025-03-04 00:36:37,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063617810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:37,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:37,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:37,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448228625] [2025-03-04 00:36:37,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:37,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:37,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:37,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:37,864 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-04 00:36:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:38,601 INFO L93 Difference]: Finished difference Result 17715 states and 28757 transitions. [2025-03-04 00:36:38,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 00:36:38,606 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-04 00:36:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:38,658 INFO L225 Difference]: With dead ends: 17715 [2025-03-04 00:36:38,658 INFO L226 Difference]: Without dead ends: 12311 [2025-03-04 00:36:38,675 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-04 00:36:38,675 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-04 00:36:38,676 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-04 00:36:38,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12311 states. [2025-03-04 00:36:38,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12311 to 7439. [2025-03-04 00:36:38,987 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-04 00:36:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7439 states to 7439 states and 12083 transitions. [2025-03-04 00:36:39,012 INFO L78 Accepts]: Start accepts. Automaton has 7439 states and 12083 transitions. Word has length 479 [2025-03-04 00:36:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:39,014 INFO L471 AbstractCegarLoop]: Abstraction has 7439 states and 12083 transitions. [2025-03-04 00:36:39,014 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-04 00:36:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 7439 states and 12083 transitions. [2025-03-04 00:36:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-04 00:36:39,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:39,020 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-04 00:36:39,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 00:36:39,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:39,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash -375992818, now seen corresponding path program 1 times [2025-03-04 00:36:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31157888] [2025-03-04 00:36:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:39,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-04 00:36:39,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-04 00:36:39,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:39,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:39,202 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-04 00:36:39,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:39,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31157888] [2025-03-04 00:36:39,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31157888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:39,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:39,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675346779] [2025-03-04 00:36:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:39,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:39,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:39,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:39,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:39,204 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-04 00:36:39,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:39,472 INFO L93 Difference]: Finished difference Result 11040 states and 17921 transitions. [2025-03-04 00:36:39,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:39,473 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-04 00:36:39,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:39,496 INFO L225 Difference]: With dead ends: 11040 [2025-03-04 00:36:39,496 INFO L226 Difference]: Without dead ends: 7453 [2025-03-04 00:36:39,503 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-04 00:36:39,504 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-04 00:36:39,504 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-04 00:36:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-03-04 00:36:39,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 5114. [2025-03-04 00:36:39,674 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-04 00:36:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 8288 transitions. [2025-03-04 00:36:39,689 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 8288 transitions. Word has length 479 [2025-03-04 00:36:39,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:39,690 INFO L471 AbstractCegarLoop]: Abstraction has 5114 states and 8288 transitions. [2025-03-04 00:36:39,690 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-04 00:36:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 8288 transitions. [2025-03-04 00:36:39,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-04 00:36:39,696 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:39,696 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-04 00:36:39,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 00:36:39,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:39,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:39,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1836522913, now seen corresponding path program 1 times [2025-03-04 00:36:39,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:39,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201662843] [2025-03-04 00:36:39,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:39,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:39,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:36:41,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:36:41,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:41,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:41,329 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-04 00:36:41,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:41,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201662843] [2025-03-04 00:36:41,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201662843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:41,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639635272] [2025-03-04 00:36:41,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:41,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:41,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:41,332 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-04 00:36:41,334 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-04 00:36:41,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-04 00:36:41,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-04 00:36:41,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:41,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:41,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:36:41,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:42,043 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-04 00:36:42,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:42,415 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-04 00:36:42,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639635272] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:42,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:42,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 00:36:42,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859074157] [2025-03-04 00:36:42,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:42,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 00:36:42,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:42,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 00:36:42,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 00:36:42,417 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-04 00:36:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:42,913 INFO L93 Difference]: Finished difference Result 10133 states and 16391 transitions. [2025-03-04 00:36:42,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 00:36:42,913 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-04 00:36:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:42,933 INFO L225 Difference]: With dead ends: 10133 [2025-03-04 00:36:42,933 INFO L226 Difference]: Without dead ends: 5170 [2025-03-04 00:36:42,945 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-04 00:36:42,946 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-04 00:36:42,947 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-04 00:36:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2025-03-04 00:36:43,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 5150. [2025-03-04 00:36:43,146 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-04 00:36:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5150 states to 5150 states and 8297 transitions. [2025-03-04 00:36:43,159 INFO L78 Accepts]: Start accepts. Automaton has 5150 states and 8297 transitions. Word has length 480 [2025-03-04 00:36:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:43,159 INFO L471 AbstractCegarLoop]: Abstraction has 5150 states and 8297 transitions. [2025-03-04 00:36:43,160 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-04 00:36:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 5150 states and 8297 transitions. [2025-03-04 00:36:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-04 00:36:43,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:43,164 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-04 00:36:43,174 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-04 00:36:43,365 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-04 00:36:43,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:43,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash 250075369, now seen corresponding path program 1 times [2025-03-04 00:36:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415141632] [2025-03-04 00:36:43,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:43,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:43,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:36:43,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:36:43,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:43,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:44,352 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-04 00:36:44,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415141632] [2025-03-04 00:36:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415141632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470286408] [2025-03-04 00:36:44,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:44,355 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-04 00:36:44,357 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-04 00:36:44,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-04 00:36:44,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-04 00:36:44,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:44,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:44,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:36:44,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:44,966 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-04 00:36:44,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:45,302 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-04 00:36:45,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470286408] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:36:45,302 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:36:45,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2025-03-04 00:36:45,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374369045] [2025-03-04 00:36:45,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:45,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 00:36:45,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:45,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 00:36:45,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 00:36:45,306 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-04 00:36:46,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:46,432 INFO L93 Difference]: Finished difference Result 7990 states and 12802 transitions. [2025-03-04 00:36:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 00:36:46,433 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-04 00:36:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:46,444 INFO L225 Difference]: With dead ends: 7990 [2025-03-04 00:36:46,444 INFO L226 Difference]: Without dead ends: 2923 [2025-03-04 00:36:46,451 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-04 00:36:46,452 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-04 00:36:46,452 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-04 00:36:46,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2923 states. [2025-03-04 00:36:46,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2923 to 2558. [2025-03-04 00:36:46,614 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-04 00:36:46,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4050 transitions. [2025-03-04 00:36:46,624 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4050 transitions. Word has length 481 [2025-03-04 00:36:46,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:46,625 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4050 transitions. [2025-03-04 00:36:46,626 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-04 00:36:46,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4050 transitions. [2025-03-04 00:36:46,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-04 00:36:46,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:46,631 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-04 00:36:46,641 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-04 00:36:46,832 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-04 00:36:46,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:46,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:46,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1084690438, now seen corresponding path program 1 times [2025-03-04 00:36:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982719563] [2025-03-04 00:36:46,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-04 00:36:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-04 00:36:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:46,993 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-04 00:36:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:46,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982719563] [2025-03-04 00:36:46,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982719563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:46,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:46,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 00:36:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501317807] [2025-03-04 00:36:46,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:46,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 00:36:46,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:46,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 00:36:46,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 00:36:46,996 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-04 00:36:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:47,159 INFO L93 Difference]: Finished difference Result 7104 states and 11278 transitions. [2025-03-04 00:36:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 00:36:47,160 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-04 00:36:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:47,174 INFO L225 Difference]: With dead ends: 7104 [2025-03-04 00:36:47,174 INFO L226 Difference]: Without dead ends: 4863 [2025-03-04 00:36:47,180 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-04 00:36:47,182 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 495 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-04 00:36:47,183 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-04 00:36:47,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2025-03-04 00:36:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 2852. [2025-03-04 00:36:47,292 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-04 00:36:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 4508 transitions. [2025-03-04 00:36:47,301 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 4508 transitions. Word has length 482 [2025-03-04 00:36:47,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:47,302 INFO L471 AbstractCegarLoop]: Abstraction has 2852 states and 4508 transitions. [2025-03-04 00:36:47,302 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-04 00:36:47,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 4508 transitions. [2025-03-04 00:36:47,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-04 00:36:47,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:47,306 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-04 00:36:47,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 00:36:47,306 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:47,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:47,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1185602405, now seen corresponding path program 1 times [2025-03-04 00:36:47,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:47,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640371315] [2025-03-04 00:36:47,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:47,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:47,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-04 00:36:47,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-04 00:36:47,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:47,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:48,031 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-04 00:36:48,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:48,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640371315] [2025-03-04 00:36:48,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640371315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:36:48,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:36:48,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 00:36:48,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22826567] [2025-03-04 00:36:48,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:36:48,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 00:36:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:48,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 00:36:48,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 00:36:48,034 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-04 00:36:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:48,435 INFO L93 Difference]: Finished difference Result 9609 states and 15256 transitions. [2025-03-04 00:36:48,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 00:36:48,436 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-04 00:36:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:48,482 INFO L225 Difference]: With dead ends: 9609 [2025-03-04 00:36:48,483 INFO L226 Difference]: Without dead ends: 6974 [2025-03-04 00:36:48,487 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-04 00:36:48,488 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-04 00:36:48,489 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-04 00:36:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-03-04 00:36:48,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6799. [2025-03-04 00:36:48,779 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-04 00:36:48,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6799 states to 6799 states and 10769 transitions. [2025-03-04 00:36:48,800 INFO L78 Accepts]: Start accepts. Automaton has 6799 states and 10769 transitions. Word has length 482 [2025-03-04 00:36:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:48,802 INFO L471 AbstractCegarLoop]: Abstraction has 6799 states and 10769 transitions. [2025-03-04 00:36:48,802 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-04 00:36:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 6799 states and 10769 transitions. [2025-03-04 00:36:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-03-04 00:36:48,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:48,809 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-04 00:36:48,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 00:36:48,810 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:48,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:48,810 INFO L85 PathProgramCache]: Analyzing trace with hash -905252516, now seen corresponding path program 1 times [2025-03-04 00:36:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:48,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778350198] [2025-03-04 00:36:48,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:48,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-04 00:36:49,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-04 00:36:49,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:49,735 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-04 00:36:49,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778350198] [2025-03-04 00:36:49,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778350198] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:49,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942420679] [2025-03-04 00:36:49,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:49,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:49,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:49,739 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-04 00:36:49,766 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-04 00:36:49,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-03-04 00:36:50,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-03-04 00:36:50,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:50,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:50,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 1180 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 00:36:50,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:52,005 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-04 00:36:52,007 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:36:52,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942420679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:52,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:36:52,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2025-03-04 00:36:52,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224276283] [2025-03-04 00:36:52,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:36:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 00:36:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:36:52,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 00:36:52,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-04 00:36:52,491 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-04 00:36:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:36:54,693 INFO L93 Difference]: Finished difference Result 19583 states and 30729 transitions. [2025-03-04 00:36:54,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 00:36:54,694 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-04 00:36:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:36:54,726 INFO L225 Difference]: With dead ends: 19583 [2025-03-04 00:36:54,726 INFO L226 Difference]: Without dead ends: 13281 [2025-03-04 00:36:54,740 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-04 00:36:54,741 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1436 mSDsluCounter, 1625 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 00:36:54,741 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.3s Time] [2025-03-04 00:36:54,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13281 states. [2025-03-04 00:36:55,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13281 to 13183. [2025-03-04 00:36:55,246 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-04 00:36:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13183 states to 13183 states and 20264 transitions. [2025-03-04 00:36:55,270 INFO L78 Accepts]: Start accepts. Automaton has 13183 states and 20264 transitions. Word has length 482 [2025-03-04 00:36:55,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:36:55,271 INFO L471 AbstractCegarLoop]: Abstraction has 13183 states and 20264 transitions. [2025-03-04 00:36:55,271 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-04 00:36:55,271 INFO L276 IsEmpty]: Start isEmpty. Operand 13183 states and 20264 transitions. [2025-03-04 00:36:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-04 00:36:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:36:55,279 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-04 00:36:55,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 00:36:55,481 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-04 00:36:55,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:36:55,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:36:55,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1433797229, now seen corresponding path program 1 times [2025-03-04 00:36:55,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:36:55,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213127816] [2025-03-04 00:36:55,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:55,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:36:55,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-04 00:36:55,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-04 00:36:55,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:55,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:56,739 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-04 00:36:56,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:36:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213127816] [2025-03-04 00:36:56,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213127816] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:36:56,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82087150] [2025-03-04 00:36:56,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:36:56,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:36:56,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:36:56,742 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-04 00:36:56,744 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-04 00:36:56,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-04 00:36:57,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-04 00:36:57,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:36:57,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:36:57,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 00:36:57,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:36:58,158 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-04 00:36:58,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:00,393 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-04 00:37:00,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82087150] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:00,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:00,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18, 18] total 40 [2025-03-04 00:37:00,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932909372] [2025-03-04 00:37:00,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:00,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 00:37:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:00,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 00:37:00,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1232, Unknown=0, NotChecked=0, Total=1560 [2025-03-04 00:37:00,398 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-04 00:37:05,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:05,924 INFO L93 Difference]: Finished difference Result 58485 states and 89602 transitions. [2025-03-04 00:37:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-04 00:37:05,925 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-04 00:37:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:06,005 INFO L225 Difference]: With dead ends: 58485 [2025-03-04 00:37:06,005 INFO L226 Difference]: Without dead ends: 45523 [2025-03-04 00:37:06,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1044 GetRequests, 949 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2349 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2357, Invalid=6955, Unknown=0, NotChecked=0, Total=9312 [2025-03-04 00:37:06,031 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 10801 mSDsluCounter, 4740 mSDsCounter, 0 mSdLazyCounter, 4160 mSolverCounterSat, 881 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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-04 00:37:06,031 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-04 00:37:06,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45523 states. [2025-03-04 00:37:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45523 to 14859. [2025-03-04 00:37:06,697 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-04 00:37:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14859 states to 14859 states and 22548 transitions. [2025-03-04 00:37:06,724 INFO L78 Accepts]: Start accepts. Automaton has 14859 states and 22548 transitions. Word has length 484 [2025-03-04 00:37:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:06,725 INFO L471 AbstractCegarLoop]: Abstraction has 14859 states and 22548 transitions. [2025-03-04 00:37:06,725 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-04 00:37:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14859 states and 22548 transitions. [2025-03-04 00:37:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-04 00:37:06,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:06,733 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-04 00:37:06,744 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-04 00:37:06,937 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-04 00:37:06,937 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:06,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1313677356, now seen corresponding path program 1 times [2025-03-04 00:37:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:06,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935174312] [2025-03-04 00:37:06,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:06,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-04 00:37:08,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-04 00:37:08,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:08,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:11,125 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-04 00:37:11,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:11,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935174312] [2025-03-04 00:37:11,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935174312] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:11,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811494171] [2025-03-04 00:37:11,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:11,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:11,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:11,155 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-04 00:37:11,156 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-04 00:37:11,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-04 00:37:11,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-04 00:37:11,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:11,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:11,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 00:37:11,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:15,906 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-04 00:37:15,906 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:17,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811494171] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:17,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:37:17,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 24] total 33 [2025-03-04 00:37:17,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004314231] [2025-03-04 00:37:17,735 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:17,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 00:37:17,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:17,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 00:37:17,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1275, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 00:37:17,738 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-04 00:37:27,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:37:27,938 INFO L93 Difference]: Finished difference Result 72479 states and 112318 transitions. [2025-03-04 00:37:27,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-04 00:37:27,938 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-04 00:37:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:37:28,025 INFO L225 Difference]: With dead ends: 72479 [2025-03-04 00:37:28,025 INFO L226 Difference]: Without dead ends: 59685 [2025-03-04 00:37:28,048 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-04 00:37:28,049 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 14953 mSDsluCounter, 4863 mSDsCounter, 0 mSdLazyCounter, 4648 mSolverCounterSat, 720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:37:28,049 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.1s Time] [2025-03-04 00:37:28,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59685 states. [2025-03-04 00:37:28,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59685 to 15851. [2025-03-04 00:37:28,916 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-04 00:37:28,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 24090 transitions. [2025-03-04 00:37:28,940 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 24090 transitions. Word has length 484 [2025-03-04 00:37:28,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:37:28,941 INFO L471 AbstractCegarLoop]: Abstraction has 15851 states and 24090 transitions. [2025-03-04 00:37:28,941 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-04 00:37:28,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 24090 transitions. [2025-03-04 00:37:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-04 00:37:28,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:37:28,947 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-04 00:37:28,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 00:37:29,147 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-04 00:37:29,148 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:37:29,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:37:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash -544507341, now seen corresponding path program 1 times [2025-03-04 00:37:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:37:29,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423013568] [2025-03-04 00:37:29,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:37:29,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-04 00:37:29,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-04 00:37:29,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:29,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:30,746 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-04 00:37:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:37:30,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423013568] [2025-03-04 00:37:30,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423013568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:37:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345650322] [2025-03-04 00:37:30,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:37:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:37:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:37:30,748 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-04 00:37:30,749 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-04 00:37:30,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-04 00:37:31,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-04 00:37:31,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:37:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:37:31,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 00:37:31,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:37:34,418 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4627 proven. 1126 refuted. 0 times theorem prover too weak. 3359 trivial. 0 not checked. [2025-03-04 00:37:34,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:37:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 357 proven. 987 refuted. 0 times theorem prover too weak. 7768 trivial. 0 not checked. [2025-03-04 00:37:35,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345650322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:37:35,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:37:35,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 25] total 56 [2025-03-04 00:37:35,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195026798] [2025-03-04 00:37:35,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:37:35,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-04 00:37:35,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:37:35,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-04 00:37:35,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=2411, Unknown=0, NotChecked=0, Total=3080 [2025-03-04 00:37:35,846 INFO L87 Difference]: Start difference. First operand 15851 states and 24090 transitions. Second operand has 56 states, 51 states have (on average 8.372549019607844) internal successors, (427), 48 states have internal predecessors, (427), 18 states have call successors, (183), 8 states have call predecessors, (183), 18 states have return successors, (184), 17 states have call predecessors, (184), 18 states have call successors, (184)