./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:09:06,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:09:06,133 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:09:06,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:09:06,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:09:06,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:09:06,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:09:06,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:09:06,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:09:06,189 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:09:06,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:09:06,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:09:06,189 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:09:06,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:09:06,189 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:09:06,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:09:06,190 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:09:06,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:09:06,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:09:06,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:09:06,194 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:09:06,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:09:06,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:09:06,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:09:06,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:09:06,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:09:06,195 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e08b130d986262ceb0772f034a60f5b23796cc6f800ada70e6af5834a62fdc07 [2025-01-09 13:09:06,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:09:06,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:09:06,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:09:06,512 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:09:06,512 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:09:06,513 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2025-01-09 13:09:07,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c93963e2f/7e4162a622064ef2915ef89246d48d74/FLAGe60fd0a44 [2025-01-09 13:09:08,103 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:09:08,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i [2025-01-09 13:09:08,113 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c93963e2f/7e4162a622064ef2915ef89246d48d74/FLAGe60fd0a44 [2025-01-09 13:09:08,412 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c93963e2f/7e4162a622064ef2915ef89246d48d74 [2025-01-09 13:09:08,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:09:08,415 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:09:08,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:09:08,416 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:09:08,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:09:08,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d5e064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08, skipping insertion in model container [2025-01-09 13:09:08,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:09:08,513 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i[916,929] [2025-01-09 13:09:08,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:09:08,571 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:09:08,577 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-63.i[916,929] [2025-01-09 13:09:08,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:09:08,611 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:09:08,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08 WrapperNode [2025-01-09 13:09:08,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:09:08,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:09:08,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:09:08,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:09:08,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,650 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2025-01-09 13:09:08,651 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:09:08,651 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:09:08,651 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:09:08,651 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:09:08,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,680 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 13:09:08,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,693 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:09:08,698 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:09:08,698 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:09:08,698 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:09:08,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (1/1) ... [2025-01-09 13:09:08,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:09:08,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:09:08,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 13:09:08,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 13:09:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:09:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:09:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:09:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:09:08,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:09:08,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:09:08,788 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:09:08,790 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:09:09,161 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2025-01-09 13:09:09,161 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:09:09,172 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:09:09,174 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:09:09,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:09:09 BoogieIcfgContainer [2025-01-09 13:09:09,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:09:09,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:09:09,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:09:09,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:09:09,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:09:08" (1/3) ... [2025-01-09 13:09:09,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c95329c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:09:09, skipping insertion in model container [2025-01-09 13:09:09,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:08" (2/3) ... [2025-01-09 13:09:09,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c95329c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:09:09, skipping insertion in model container [2025-01-09 13:09:09,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:09:09" (3/3) ... [2025-01-09 13:09:09,183 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-63.i [2025-01-09 13:09:09,196 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:09:09,197 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-63.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:09:09,260 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:09:09,268 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;@385d300, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:09:09,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:09:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 13:09:09,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:09,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:09,279 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:09,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:09,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1372424058, now seen corresponding path program 1 times [2025-01-09 13:09:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:09,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316014554] [2025-01-09 13:09:09,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:09,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:09,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:09,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:09,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:09,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:09,577 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 13:09:09,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:09,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316014554] [2025-01-09 13:09:09,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316014554] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:09:09,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133092656] [2025-01-09 13:09:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:09,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:09:09,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:09:09,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:09:09,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 13:09:09,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:09,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:09,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:09,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:09,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:09:09,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:09:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-01-09 13:09:09,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:09:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133092656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:09:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:09:09,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525037647] [2025-01-09 13:09:09,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:09:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:09,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:09:09,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:09:09,784 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.476923076923077) internal successors, (96), 66 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 13:09:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:09,808 INFO L93 Difference]: Finished difference Result 168 states and 285 transitions. [2025-01-09 13:09:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:09:09,811 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 143 [2025-01-09 13:09:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:09,816 INFO L225 Difference]: With dead ends: 168 [2025-01-09 13:09:09,816 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 13:09:09,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:09:09,821 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:09,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:09:09,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 13:09:09,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 13:09:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-01-09 13:09:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-01-09 13:09:09,851 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 143 [2025-01-09 13:09:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:09,851 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-01-09 13:09:09,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 13:09:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-01-09 13:09:09,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:09,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:09,854 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:09,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:09:10,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 13:09:10,056 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:10,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1668222646, now seen corresponding path program 1 times [2025-01-09 13:09:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:10,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537210716] [2025-01-09 13:09:10,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:10,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:10,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:10,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:10,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:10,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:10,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537210716] [2025-01-09 13:09:10,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537210716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:10,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:10,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:09:10,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766445218] [2025-01-09 13:09:10,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:09:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:10,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:09:10,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:09:10,282 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:10,354 INFO L93 Difference]: Finished difference Result 214 states and 321 transitions. [2025-01-09 13:09:10,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:09:10,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:10,356 INFO L225 Difference]: With dead ends: 214 [2025-01-09 13:09:10,356 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 13:09:10,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:09:10,357 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 71 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:10,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 259 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:09:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 13:09:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2025-01-09 13:09:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 100 states have (on average 1.39) internal successors, (139), 101 states have internal predecessors, (139), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:09:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2025-01-09 13:09:10,372 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 195 transitions. Word has length 143 [2025-01-09 13:09:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:10,372 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 195 transitions. [2025-01-09 13:09:10,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 195 transitions. [2025-01-09 13:09:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:10,376 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:10,377 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:09:10,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:10,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:10,378 INFO L85 PathProgramCache]: Analyzing trace with hash 179229258, now seen corresponding path program 1 times [2025-01-09 13:09:10,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:10,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112681682] [2025-01-09 13:09:10,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:10,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:10,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:10,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:10,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:10,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:10,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112681682] [2025-01-09 13:09:10,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112681682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:10,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:09:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595679705] [2025-01-09 13:09:10,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:10,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:09:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:10,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:09:10,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:09:10,837 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:10,986 INFO L93 Difference]: Finished difference Result 372 states and 557 transitions. [2025-01-09 13:09:10,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:09:10,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:10,993 INFO L225 Difference]: With dead ends: 372 [2025-01-09 13:09:10,995 INFO L226 Difference]: Without dead ends: 244 [2025-01-09 13:09:10,996 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-01-09 13:09:10,999 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:11,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 350 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:09:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2025-01-09 13:09:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 178. [2025-01-09 13:09:11,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 126 states have (on average 1.3571428571428572) internal successors, (171), 127 states have internal predecessors, (171), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 13:09:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 267 transitions. [2025-01-09 13:09:11,043 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 267 transitions. Word has length 143 [2025-01-09 13:09:11,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:11,043 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 267 transitions. [2025-01-09 13:09:11,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:11,044 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 267 transitions. [2025-01-09 13:09:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:11,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:11,045 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:11,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:09:11,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash 45215752, now seen corresponding path program 1 times [2025-01-09 13:09:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:11,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618654533] [2025-01-09 13:09:11,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:11,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:11,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:11,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:11,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:11,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:11,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:11,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618654533] [2025-01-09 13:09:11,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618654533] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:11,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:11,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:09:11,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61061982] [2025-01-09 13:09:11,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:11,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:09:11,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:11,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:09:11,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:09:11,471 INFO L87 Difference]: Start difference. First operand 178 states and 267 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:11,555 INFO L93 Difference]: Finished difference Result 376 states and 551 transitions. [2025-01-09 13:09:11,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:09:11,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:11,558 INFO L225 Difference]: With dead ends: 376 [2025-01-09 13:09:11,558 INFO L226 Difference]: Without dead ends: 248 [2025-01-09 13:09:11,559 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-01-09 13:09:11,560 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 142 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:11,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 311 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:09:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-01-09 13:09:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 155. [2025-01-09 13:09:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 110 states have internal predecessors, (145), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2025-01-09 13:09:11,573 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 143 [2025-01-09 13:09:11,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:11,573 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2025-01-09 13:09:11,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2025-01-09 13:09:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:11,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:11,575 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:11,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:09:11,575 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1675082694, now seen corresponding path program 1 times [2025-01-09 13:09:11,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:11,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460304610] [2025-01-09 13:09:11,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:11,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:11,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:11,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:11,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:17,657 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:17,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:17,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460304610] [2025-01-09 13:09:17,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460304610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:17,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:17,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 13:09:17,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710490767] [2025-01-09 13:09:17,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:17,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:09:17,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:17,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:09:17,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-01-09 13:09:17,660 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:18,595 INFO L93 Difference]: Finished difference Result 382 states and 548 transitions. [2025-01-09 13:09:18,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:09:18,596 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:18,603 INFO L225 Difference]: With dead ends: 382 [2025-01-09 13:09:18,603 INFO L226 Difference]: Without dead ends: 283 [2025-01-09 13:09:18,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:09:18,604 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 333 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:18,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 550 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 13:09:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-01-09 13:09:18,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 174. [2025-01-09 13:09:18,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 129 states have internal predecessors, (173), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:18,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 253 transitions. [2025-01-09 13:09:18,629 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 253 transitions. Word has length 143 [2025-01-09 13:09:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:18,630 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 253 transitions. [2025-01-09 13:09:18,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 253 transitions. [2025-01-09 13:09:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:18,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:18,635 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:18,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:09:18,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:18,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash -319062012, now seen corresponding path program 1 times [2025-01-09 13:09:18,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:18,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673693097] [2025-01-09 13:09:18,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:18,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:18,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:18,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:18,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:18,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:24,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:24,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673693097] [2025-01-09 13:09:24,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673693097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:24,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:24,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:09:24,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631000150] [2025-01-09 13:09:24,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:24,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:09:24,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:24,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:09:24,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:09:24,779 INFO L87 Difference]: Start difference. First operand 174 states and 253 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:26,811 INFO L93 Difference]: Finished difference Result 600 states and 848 transitions. [2025-01-09 13:09:26,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 13:09:26,812 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:26,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:26,815 INFO L225 Difference]: With dead ends: 600 [2025-01-09 13:09:26,815 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 13:09:26,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2025-01-09 13:09:26,816 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 590 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:26,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 874 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 13:09:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 13:09:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 204. [2025-01-09 13:09:26,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 159 states have internal predecessors, (215), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 295 transitions. [2025-01-09 13:09:26,833 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 295 transitions. Word has length 143 [2025-01-09 13:09:26,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:26,834 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 295 transitions. [2025-01-09 13:09:26,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 295 transitions. [2025-01-09 13:09:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:26,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:26,835 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:26,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:09:26,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:26,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:26,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1128408638, now seen corresponding path program 1 times [2025-01-09 13:09:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:26,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226251305] [2025-01-09 13:09:26,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:26,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:26,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:26,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:26,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:32,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:32,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226251305] [2025-01-09 13:09:32,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226251305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:32,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:32,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 13:09:32,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862626849] [2025-01-09 13:09:32,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:32,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 13:09:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:32,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 13:09:32,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:09:32,259 INFO L87 Difference]: Start difference. First operand 204 states and 295 transitions. Second operand has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:34,707 INFO L93 Difference]: Finished difference Result 667 states and 954 transitions. [2025-01-09 13:09:34,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:09:34,708 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:34,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:34,712 INFO L225 Difference]: With dead ends: 667 [2025-01-09 13:09:34,712 INFO L226 Difference]: Without dead ends: 519 [2025-01-09 13:09:34,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=197, Invalid=615, Unknown=0, NotChecked=0, Total=812 [2025-01-09 13:09:34,713 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 726 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:34,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 814 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 13:09:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-01-09 13:09:34,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 229. [2025-01-09 13:09:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 184 states have (on average 1.3695652173913044) internal successors, (252), 184 states have internal predecessors, (252), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 332 transitions. [2025-01-09 13:09:34,732 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 332 transitions. Word has length 143 [2025-01-09 13:09:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:34,734 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 332 transitions. [2025-01-09 13:09:34,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 15 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 332 transitions. [2025-01-09 13:09:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:34,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:34,735 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:34,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:09:34,736 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:34,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 467917578, now seen corresponding path program 1 times [2025-01-09 13:09:34,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:34,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795891057] [2025-01-09 13:09:34,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:34,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:34,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:34,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:34,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:34,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:34,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:34,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795891057] [2025-01-09 13:09:34,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795891057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:34,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:09:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566871341] [2025-01-09 13:09:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:34,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:09:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:34,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:09:34,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:09:34,910 INFO L87 Difference]: Start difference. First operand 229 states and 332 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:35,094 INFO L93 Difference]: Finished difference Result 516 states and 749 transitions. [2025-01-09 13:09:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:09:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:35,096 INFO L225 Difference]: With dead ends: 516 [2025-01-09 13:09:35,097 INFO L226 Difference]: Without dead ends: 368 [2025-01-09 13:09:35,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:09:35,097 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 173 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:35,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 503 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:09:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-01-09 13:09:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 244. [2025-01-09 13:09:35,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 199 states have (on average 1.3768844221105527) internal successors, (274), 199 states have internal predecessors, (274), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 354 transitions. [2025-01-09 13:09:35,120 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 354 transitions. Word has length 143 [2025-01-09 13:09:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:35,122 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 354 transitions. [2025-01-09 13:09:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 354 transitions. [2025-01-09 13:09:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:35,123 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:35,123 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:35,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:09:35,123 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:35,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash -341429048, now seen corresponding path program 1 times [2025-01-09 13:09:35,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020115220] [2025-01-09 13:09:35,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:35,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:35,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:35,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:35,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:38,905 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:38,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:38,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020115220] [2025-01-09 13:09:38,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020115220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:38,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:38,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 13:09:38,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638705189] [2025-01-09 13:09:38,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:38,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 13:09:38,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:38,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 13:09:38,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:09:38,907 INFO L87 Difference]: Start difference. First operand 244 states and 354 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:39,995 INFO L93 Difference]: Finished difference Result 670 states and 960 transitions. [2025-01-09 13:09:39,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 13:09:39,995 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:39,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:39,998 INFO L225 Difference]: With dead ends: 670 [2025-01-09 13:09:39,998 INFO L226 Difference]: Without dead ends: 507 [2025-01-09 13:09:39,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=277, Unknown=0, NotChecked=0, Total=420 [2025-01-09 13:09:39,999 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 495 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:39,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 628 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:09:40,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-01-09 13:09:40,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 280. [2025-01-09 13:09:40,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 235 states have (on average 1.3829787234042554) internal successors, (325), 235 states have internal predecessors, (325), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 405 transitions. [2025-01-09 13:09:40,013 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 405 transitions. Word has length 143 [2025-01-09 13:09:40,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:40,014 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 405 transitions. [2025-01-09 13:09:40,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 405 transitions. [2025-01-09 13:09:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:40,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:40,015 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:09:40,015 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 2097784520, now seen corresponding path program 1 times [2025-01-09 13:09:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358125281] [2025-01-09 13:09:40,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:40,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:40,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:40,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:40,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:40,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:40,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358125281] [2025-01-09 13:09:40,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358125281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:40,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:40,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:09:40,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653784412] [2025-01-09 13:09:40,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:40,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:09:40,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:40,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:09:40,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:09:40,134 INFO L87 Difference]: Start difference. First operand 280 states and 405 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:40,219 INFO L93 Difference]: Finished difference Result 557 states and 803 transitions. [2025-01-09 13:09:40,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:09:40,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:40,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:40,221 INFO L225 Difference]: With dead ends: 557 [2025-01-09 13:09:40,221 INFO L226 Difference]: Without dead ends: 382 [2025-01-09 13:09:40,221 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-01-09 13:09:40,222 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 138 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:40,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 353 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:09:40,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-01-09 13:09:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 268. [2025-01-09 13:09:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 223 states have (on average 1.3677130044843049) internal successors, (305), 223 states have internal predecessors, (305), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 385 transitions. [2025-01-09 13:09:40,235 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 385 transitions. Word has length 143 [2025-01-09 13:09:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:40,235 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 385 transitions. [2025-01-09 13:09:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 385 transitions. [2025-01-09 13:09:40,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 13:09:40,237 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:40,237 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:40,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:09:40,237 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:40,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1594791066, now seen corresponding path program 1 times [2025-01-09 13:09:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244652074] [2025-01-09 13:09:40,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:40,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 13:09:40,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 13:09:40,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:40,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244652074] [2025-01-09 13:09:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244652074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:40,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:09:40,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955337897] [2025-01-09 13:09:40,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:40,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:09:40,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:40,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:09:40,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:09:40,276 INFO L87 Difference]: Start difference. First operand 268 states and 385 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:40,290 INFO L93 Difference]: Finished difference Result 455 states and 656 transitions. [2025-01-09 13:09:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:09:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 143 [2025-01-09 13:09:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:40,292 INFO L225 Difference]: With dead ends: 455 [2025-01-09 13:09:40,293 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 13:09:40,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:09:40,294 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:40,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:09:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 13:09:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2025-01-09 13:09:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 225 states have (on average 1.3644444444444443) internal successors, (307), 225 states have internal predecessors, (307), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:40,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 387 transitions. [2025-01-09 13:09:40,307 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 387 transitions. Word has length 143 [2025-01-09 13:09:40,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:40,307 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 387 transitions. [2025-01-09 13:09:40,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:40,307 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 387 transitions. [2025-01-09 13:09:40,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:09:40,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:40,310 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:40,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:09:40,310 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:40,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:40,310 INFO L85 PathProgramCache]: Analyzing trace with hash 990145868, now seen corresponding path program 1 times [2025-01-09 13:09:40,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:40,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940814326] [2025-01-09 13:09:40,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:40,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:40,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:09:40,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:09:40,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:40,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:42,465 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:42,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:42,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940814326] [2025-01-09 13:09:42,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940814326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:42,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:42,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:09:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222026437] [2025-01-09 13:09:42,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:42,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:09:42,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:42,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:09:42,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:09:42,467 INFO L87 Difference]: Start difference. First operand 270 states and 387 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:43,256 INFO L93 Difference]: Finished difference Result 681 states and 974 transitions. [2025-01-09 13:09:43,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 13:09:43,257 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 13:09:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:43,259 INFO L225 Difference]: With dead ends: 681 [2025-01-09 13:09:43,259 INFO L226 Difference]: Without dead ends: 517 [2025-01-09 13:09:43,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:09:43,260 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 478 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:43,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 823 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 13:09:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-01-09 13:09:43,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 281. [2025-01-09 13:09:43,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 236 states have (on average 1.3728813559322033) internal successors, (324), 236 states have internal predecessors, (324), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-01-09 13:09:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 404 transitions. [2025-01-09 13:09:43,273 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 404 transitions. Word has length 144 [2025-01-09 13:09:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:43,274 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 404 transitions. [2025-01-09 13:09:43,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 404 transitions. [2025-01-09 13:09:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:09:43,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:43,275 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:43,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 13:09:43,275 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:43,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1559025471, now seen corresponding path program 1 times [2025-01-09 13:09:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210322970] [2025-01-09 13:09:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:43,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:43,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:09:43,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:09:43,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:43,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210322970] [2025-01-09 13:09:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210322970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:43,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:09:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035159960] [2025-01-09 13:09:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:09:43,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:43,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:09:43,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:09:43,333 INFO L87 Difference]: Start difference. First operand 281 states and 404 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:43,368 INFO L93 Difference]: Finished difference Result 575 states and 822 transitions. [2025-01-09 13:09:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:09:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 13:09:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:43,370 INFO L225 Difference]: With dead ends: 575 [2025-01-09 13:09:43,370 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 13:09:43,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:09:43,371 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 63 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:43,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 338 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:09:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 13:09:43,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 408. [2025-01-09 13:09:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 355 states have (on average 1.3633802816901408) internal successors, (484), 356 states have internal predecessors, (484), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 13:09:43,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 576 transitions. [2025-01-09 13:09:43,386 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 576 transitions. Word has length 144 [2025-01-09 13:09:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:43,386 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 576 transitions. [2025-01-09 13:09:43,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:43,387 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 576 transitions. [2025-01-09 13:09:43,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:09:43,388 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:43,388 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:43,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:09:43,388 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:43,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:43,388 INFO L85 PathProgramCache]: Analyzing trace with hash 382831372, now seen corresponding path program 1 times [2025-01-09 13:09:43,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:43,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890611293] [2025-01-09 13:09:43,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:43,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:43,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:09:43,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:09:43,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:43,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:45,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:45,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890611293] [2025-01-09 13:09:45,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890611293] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:45,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:45,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:09:45,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057311913] [2025-01-09 13:09:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:45,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:09:45,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:45,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:09:45,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:09:45,220 INFO L87 Difference]: Start difference. First operand 408 states and 576 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:45,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:45,889 INFO L93 Difference]: Finished difference Result 835 states and 1172 transitions. [2025-01-09 13:09:45,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:09:45,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 13:09:45,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:45,892 INFO L225 Difference]: With dead ends: 835 [2025-01-09 13:09:45,893 INFO L226 Difference]: Without dead ends: 580 [2025-01-09 13:09:45,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:09:45,894 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 385 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:45,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 752 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:09:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-01-09 13:09:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 490. [2025-01-09 13:09:45,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 431 states have (on average 1.3735498839907192) internal successors, (592), 434 states have internal predecessors, (592), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 13:09:45,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 692 transitions. [2025-01-09 13:09:45,917 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 692 transitions. Word has length 144 [2025-01-09 13:09:45,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:45,918 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 692 transitions. [2025-01-09 13:09:45,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 692 transitions. [2025-01-09 13:09:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:09:45,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:45,919 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:45,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 13:09:45,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:45,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:45,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1981532314, now seen corresponding path program 1 times [2025-01-09 13:09:45,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:45,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067754220] [2025-01-09 13:09:45,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:45,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:09:45,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:09:45,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:45,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:46,563 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067754220] [2025-01-09 13:09:46,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067754220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:46,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:46,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:09:46,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805669951] [2025-01-09 13:09:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:46,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:09:46,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:46,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:09:46,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:09:46,566 INFO L87 Difference]: Start difference. First operand 490 states and 692 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:47,617 INFO L93 Difference]: Finished difference Result 1242 states and 1741 transitions. [2025-01-09 13:09:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 13:09:47,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 13:09:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:47,620 INFO L225 Difference]: With dead ends: 1242 [2025-01-09 13:09:47,620 INFO L226 Difference]: Without dead ends: 842 [2025-01-09 13:09:47,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:09:47,622 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 412 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:47,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1036 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 13:09:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-01-09 13:09:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 588. [2025-01-09 13:09:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 529 states have (on average 1.385633270321361) internal successors, (733), 532 states have internal predecessors, (733), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 13:09:47,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 833 transitions. [2025-01-09 13:09:47,650 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 833 transitions. Word has length 144 [2025-01-09 13:09:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:47,650 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 833 transitions. [2025-01-09 13:09:47,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:47,651 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 833 transitions. [2025-01-09 13:09:47,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 13:09:47,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:47,652 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:47,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 13:09:47,652 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:47,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:47,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1081386530, now seen corresponding path program 1 times [2025-01-09 13:09:47,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:47,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206494432] [2025-01-09 13:09:47,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:47,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:47,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 13:09:47,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 13:09:47,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:47,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:47,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:47,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206494432] [2025-01-09 13:09:47,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206494432] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:09:47,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:09:47,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:09:47,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585282471] [2025-01-09 13:09:47,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:09:47,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:09:47,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:47,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:09:47,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:09:47,829 INFO L87 Difference]: Start difference. First operand 588 states and 833 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:47,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:47,975 INFO L93 Difference]: Finished difference Result 1318 states and 1870 transitions. [2025-01-09 13:09:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:09:47,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2025-01-09 13:09:47,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:47,980 INFO L225 Difference]: With dead ends: 1318 [2025-01-09 13:09:47,980 INFO L226 Difference]: Without dead ends: 1021 [2025-01-09 13:09:47,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:09:47,981 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 214 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:47,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 491 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:09:47,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2025-01-09 13:09:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 597. [2025-01-09 13:09:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 538 states have (on average 1.3903345724907064) internal successors, (748), 541 states have internal predecessors, (748), 50 states have call successors, (50), 8 states have call predecessors, (50), 8 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 13:09:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 848 transitions. [2025-01-09 13:09:48,012 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 848 transitions. Word has length 144 [2025-01-09 13:09:48,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:48,013 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 848 transitions. [2025-01-09 13:09:48,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-01-09 13:09:48,013 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 848 transitions. [2025-01-09 13:09:48,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 13:09:48,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:48,014 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:48,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 13:09:48,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:48,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:48,015 INFO L85 PathProgramCache]: Analyzing trace with hash 484588257, now seen corresponding path program 1 times [2025-01-09 13:09:48,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:48,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534777954] [2025-01-09 13:09:48,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:48,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:48,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 13:09:48,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 13:09:48,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:48,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:10:17,077 WARN L286 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 174 DAG size of output: 170 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 13:10:34,112 WARN L286 SmtUtils]: Spent 7.42s on a formula simplification. DAG size of input: 170 DAG size of output: 169 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)