./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-67.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_operatoramount_amount100_file-67.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 a75eac8d972521f13036387adb8ec81449423eaf0dc72863afb406909e4c7b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:10:23,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:10:23,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:10:23,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:10:23,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:10:23,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:10:23,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:10:23,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:10:23,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:10:23,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:10:23,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:10:23,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:10:23,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:10:23,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:10:23,262 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:10:23,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:10:23,263 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:10:23,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:10:23,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:10:23,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:10:23,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:10:23,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:10:23,265 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 -> a75eac8d972521f13036387adb8ec81449423eaf0dc72863afb406909e4c7b00 [2025-01-09 14:10:23,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:10:23,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:10:23,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:10:23,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:10:23,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:10:23,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-67.i [2025-01-09 14:10:24,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/594862ae3/011818e71dc749c49871bd9bb3697f7c/FLAG41d7db5a8 [2025-01-09 14:10:24,923 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:10:24,923 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-67.i [2025-01-09 14:10:24,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/594862ae3/011818e71dc749c49871bd9bb3697f7c/FLAG41d7db5a8 [2025-01-09 14:10:25,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/594862ae3/011818e71dc749c49871bd9bb3697f7c [2025-01-09 14:10:25,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:10:25,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:10:25,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:10:25,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:10:25,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:10:25,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25, skipping insertion in model container [2025-01-09 14:10:25,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:10:25,376 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_operatoramount_amount100_file-67.i[916,929] [2025-01-09 14:10:25,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:10:25,460 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:10:25,467 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_operatoramount_amount100_file-67.i[916,929] [2025-01-09 14:10:25,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:10:25,500 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:10:25,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25 WrapperNode [2025-01-09 14:10:25,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:10:25,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:10:25,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:10:25,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:10:25,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,535 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2025-01-09 14:10:25,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:10:25,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:10:25,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:10:25,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:10:25,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,573 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 14:10:25,573 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,581 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,585 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,594 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:10:25,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:10:25,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:10:25,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:10:25,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (1/1) ... [2025-01-09 14:10:25,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:10:25,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:10:25,623 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 14:10:25,629 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 14:10:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:10:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:10:25,641 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:10:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:10:25,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:10:25,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:10:25,708 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:10:25,709 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:10:25,991 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-01-09 14:10:25,991 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:10:25,998 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:10:25,998 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:10:25,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:10:25 BoogieIcfgContainer [2025-01-09 14:10:25,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:10:26,001 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:10:26,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:10:26,004 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:10:26,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:10:25" (1/3) ... [2025-01-09 14:10:26,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39028912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:10:26, skipping insertion in model container [2025-01-09 14:10:26,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:10:25" (2/3) ... [2025-01-09 14:10:26,005 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39028912 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:10:26, skipping insertion in model container [2025-01-09 14:10:26,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:10:25" (3/3) ... [2025-01-09 14:10:26,006 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-67.i [2025-01-09 14:10:26,015 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:10:26,018 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount100_file-67.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:10:26,052 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:10:26,062 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;@2c7ab095, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:10:26,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:10:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-01-09 14:10:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 14:10:26,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:26,076 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:26,076 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:26,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:26,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1349633210, now seen corresponding path program 1 times [2025-01-09 14:10:26,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:26,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935240357] [2025-01-09 14:10:26,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:26,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:26,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 14:10:26,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 14:10:26,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:26,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:10:26,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:26,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935240357] [2025-01-09 14:10:26,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935240357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:26,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:26,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:10:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948624123] [2025-01-09 14:10:26,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:26,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:10:26,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:26,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:10:26,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:10:26,541 INFO L87 Difference]: Start difference. First operand has 104 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:26,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:26,620 INFO L93 Difference]: Finished difference Result 296 states and 536 transitions. [2025-01-09 14:10:26,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:10:26,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2025-01-09 14:10:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:26,627 INFO L225 Difference]: With dead ends: 296 [2025-01-09 14:10:26,628 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 14:10:26,630 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 14:10:26,631 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 137 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:26,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 384 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:10:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 14:10:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2025-01-09 14:10:26,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.375) internal successors, (176), 128 states have internal predecessors, (176), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 14:10:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2025-01-09 14:10:26,688 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 203 [2025-01-09 14:10:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:26,689 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2025-01-09 14:10:26,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:26,691 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2025-01-09 14:10:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-01-09 14:10:26,697 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:26,697 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:26,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 14:10:26,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2090007680, now seen corresponding path program 1 times [2025-01-09 14:10:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490795538] [2025-01-09 14:10:26,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:26,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 14:10:26,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 14:10:26,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:26,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:10:27,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:27,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490795538] [2025-01-09 14:10:27,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490795538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:27,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:27,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:10:27,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973425153] [2025-01-09 14:10:27,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:27,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:10:27,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:27,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:10:27,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:10:27,348 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:27,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:27,587 INFO L93 Difference]: Finished difference Result 605 states and 938 transitions. [2025-01-09 14:10:27,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:10:27,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2025-01-09 14:10:27,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:27,592 INFO L225 Difference]: With dead ends: 605 [2025-01-09 14:10:27,592 INFO L226 Difference]: Without dead ends: 415 [2025-01-09 14:10:27,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:10:27,593 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 168 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:27,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 444 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:10:27,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-01-09 14:10:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 397. [2025-01-09 14:10:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 268 states have (on average 1.3694029850746268) internal successors, (367), 268 states have internal predecessors, (367), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 14:10:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 615 transitions. [2025-01-09 14:10:27,645 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 615 transitions. Word has length 204 [2025-01-09 14:10:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:27,646 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 615 transitions. [2025-01-09 14:10:27,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 615 transitions. [2025-01-09 14:10:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:10:27,653 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:27,653 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:27,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:10:27,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:27,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1455252023, now seen corresponding path program 1 times [2025-01-09 14:10:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478296607] [2025-01-09 14:10:27,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:27,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:10:27,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:10:27,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:27,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:31,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:10:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478296607] [2025-01-09 14:10:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478296607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 14:10:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308932132] [2025-01-09 14:10:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:31,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 14:10:31,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:31,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 14:10:31,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:10:31,172 INFO L87 Difference]: Start difference. First operand 397 states and 615 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:32,248 INFO L93 Difference]: Finished difference Result 1185 states and 1828 transitions. [2025-01-09 14:10:32,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:10:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:10:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:32,259 INFO L225 Difference]: With dead ends: 1185 [2025-01-09 14:10:32,260 INFO L226 Difference]: Without dead ends: 993 [2025-01-09 14:10:32,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:10:32,262 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 484 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:32,262 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 945 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:10:32,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-01-09 14:10:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 781. [2025-01-09 14:10:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 556 states have (on average 1.4154676258992807) internal successors, (787), 556 states have internal predecessors, (787), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2025-01-09 14:10:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1221 transitions. [2025-01-09 14:10:32,348 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1221 transitions. Word has length 206 [2025-01-09 14:10:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:32,349 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1221 transitions. [2025-01-09 14:10:32,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:32,349 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1221 transitions. [2025-01-09 14:10:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:10:32,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:32,352 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:32,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:10:32,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:32,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:32,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1848279033, now seen corresponding path program 1 times [2025-01-09 14:10:32,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:32,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326296502] [2025-01-09 14:10:32,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:32,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:32,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:10:32,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:10:32,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:32,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:10:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326296502] [2025-01-09 14:10:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326296502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:10:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659552082] [2025-01-09 14:10:32,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:10:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:32,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:10:32,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:10:32,517 INFO L87 Difference]: Start difference. First operand 781 states and 1221 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:32,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:32,636 INFO L93 Difference]: Finished difference Result 1847 states and 2892 transitions. [2025-01-09 14:10:32,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:10:32,637 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:10:32,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:32,646 INFO L225 Difference]: With dead ends: 1847 [2025-01-09 14:10:32,646 INFO L226 Difference]: Without dead ends: 1136 [2025-01-09 14:10:32,649 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 14:10:32,651 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 94 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:32,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 625 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:10:32,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1136 states. [2025-01-09 14:10:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1136 to 1134. [2025-01-09 14:10:32,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 813 states have (on average 1.4132841328413284) internal successors, (1149), 813 states have internal predecessors, (1149), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2025-01-09 14:10:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1769 transitions. [2025-01-09 14:10:32,768 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1769 transitions. Word has length 206 [2025-01-09 14:10:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:32,770 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1769 transitions. [2025-01-09 14:10:32,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1769 transitions. [2025-01-09 14:10:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 14:10:32,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:32,773 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:32,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:10:32,774 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:32,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:32,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1559851595, now seen corresponding path program 1 times [2025-01-09 14:10:32,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:32,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894151880] [2025-01-09 14:10:32,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:32,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:32,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 14:10:32,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 14:10:32,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:32,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:10:33,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:33,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894151880] [2025-01-09 14:10:33,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894151880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:33,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:33,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:10:33,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466797228] [2025-01-09 14:10:33,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:33,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:10:33,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:33,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:10:33,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:10:33,063 INFO L87 Difference]: Start difference. First operand 1134 states and 1769 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:33,304 INFO L93 Difference]: Finished difference Result 2254 states and 3503 transitions. [2025-01-09 14:10:33,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:10:33,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 206 [2025-01-09 14:10:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:33,310 INFO L225 Difference]: With dead ends: 2254 [2025-01-09 14:10:33,311 INFO L226 Difference]: Without dead ends: 1180 [2025-01-09 14:10:33,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:10:33,313 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 163 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:33,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 589 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:10:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2025-01-09 14:10:33,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1140. [2025-01-09 14:10:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 819 states have (on average 1.4017094017094016) internal successors, (1148), 819 states have internal predecessors, (1148), 310 states have call successors, (310), 10 states have call predecessors, (310), 10 states have return successors, (310), 310 states have call predecessors, (310), 310 states have call successors, (310) [2025-01-09 14:10:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1768 transitions. [2025-01-09 14:10:33,390 INFO L78 Accepts]: Start accepts. Automaton has 1140 states and 1768 transitions. Word has length 206 [2025-01-09 14:10:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:33,390 INFO L471 AbstractCegarLoop]: Abstraction has 1140 states and 1768 transitions. [2025-01-09 14:10:33,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1140 states and 1768 transitions. [2025-01-09 14:10:33,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 14:10:33,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:33,392 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:33,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:10:33,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:33,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 902250660, now seen corresponding path program 1 times [2025-01-09 14:10:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:33,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691299948] [2025-01-09 14:10:33,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:33,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:33,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 14:10:33,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 14:10:33,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:33,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:34,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-01-09 14:10:34,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:10:34,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691299948] [2025-01-09 14:10:34,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691299948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:10:34,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:10:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 14:10:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583128032] [2025-01-09 14:10:34,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:10:34,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:10:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:10:34,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:10:34,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:10:34,757 INFO L87 Difference]: Start difference. First operand 1140 states and 1768 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:10:35,278 INFO L93 Difference]: Finished difference Result 1778 states and 2765 transitions. [2025-01-09 14:10:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:10:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 208 [2025-01-09 14:10:35,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:10:35,287 INFO L225 Difference]: With dead ends: 1778 [2025-01-09 14:10:35,287 INFO L226 Difference]: Without dead ends: 1433 [2025-01-09 14:10:35,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:10:35,289 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 195 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:10:35,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 748 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:10:35,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2025-01-09 14:10:35,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1418. [2025-01-09 14:10:35,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 1033 states have (on average 1.4133591481122942) internal successors, (1460), 1033 states have internal predecessors, (1460), 372 states have call successors, (372), 12 states have call predecessors, (372), 12 states have return successors, (372), 372 states have call predecessors, (372), 372 states have call successors, (372) [2025-01-09 14:10:35,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 2204 transitions. [2025-01-09 14:10:35,379 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 2204 transitions. Word has length 208 [2025-01-09 14:10:35,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:10:35,379 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 2204 transitions. [2025-01-09 14:10:35,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-01-09 14:10:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 2204 transitions. [2025-01-09 14:10:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 14:10:35,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:10:35,381 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:10:35,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:10:35,381 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:10:35,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:10:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1795692178, now seen corresponding path program 1 times [2025-01-09 14:10:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:10:35,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087035808] [2025-01-09 14:10:35,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:10:35,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:10:35,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 14:10:35,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 14:10:35,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:10:35,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:10:55,274 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:11:15,617 WARN L286 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 14:11:51,770 WARN L286 SmtUtils]: Spent 20.03s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)