./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:36:31,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:36:31,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:36:31,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:36:31,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:36:31,742 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:36:31,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:36:31,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:36:31,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:36:31,744 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:36:31,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:36:31,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:36:31,745 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:36:31,745 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:36:31,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:36:31,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:36:31,747 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:36:31,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:36:31,747 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 [2025-03-17 01:36:31,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:36:31,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:36:32,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:36:32,002 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:36:32,002 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:36:32,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2025-03-17 01:36:33,189 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5283d36b/1c8f91935a9a459aad1f4a42d5361616/FLAG6ff7ff758 [2025-03-17 01:36:33,387 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:36:33,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2025-03-17 01:36:33,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5283d36b/1c8f91935a9a459aad1f4a42d5361616/FLAG6ff7ff758 [2025-03-17 01:36:33,403 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f5283d36b/1c8f91935a9a459aad1f4a42d5361616 [2025-03-17 01:36:33,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:36:33,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:36:33,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:36:33,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:36:33,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:36:33,410 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,411 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47254d7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33, skipping insertion in model container [2025-03-17 01:36:33,411 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,426 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:36:33,518 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i[919,932] [2025-03-17 01:36:33,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:36:33,599 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:36:33,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i[919,932] [2025-03-17 01:36:33,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:36:33,641 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:36:33,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33 WrapperNode [2025-03-17 01:36:33,642 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:36:33,643 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:36:33,643 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:36:33,643 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:36:33,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,683 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2025-03-17 01:36:33,683 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:36:33,684 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:36:33,684 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:36:33,684 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:36:33,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,723 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-17 01:36:33,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:36:33,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:36:33,743 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:36:33,743 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:36:33,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (1/1) ... [2025-03-17 01:36:33,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:36:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:33,773 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 01:36:33,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 01:36:33,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:36:33,792 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:36:33,792 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:36:33,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:36:33,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:36:33,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:36:33,857 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:36:33,859 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:36:34,285 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-17 01:36:34,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:36:34,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:36:34,301 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:36:34,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:36:34 BoogieIcfgContainer [2025-03-17 01:36:34,301 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:36:34,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:36:34,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:36:34,307 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:36:34,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:36:33" (1/3) ... [2025-03-17 01:36:34,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a16132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:36:34, skipping insertion in model container [2025-03-17 01:36:34,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:36:33" (2/3) ... [2025-03-17 01:36:34,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25a16132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:36:34, skipping insertion in model container [2025-03-17 01:36:34,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:36:34" (3/3) ... [2025-03-17 01:36:34,310 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2025-03-17 01:36:34,321 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:36:34,323 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:36:34,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:36:34,372 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;@65e0c3da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:36:34,372 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:36:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 01:36:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 01:36:34,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:34,389 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:34,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:34,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1191972477, now seen corresponding path program 1 times [2025-03-17 01:36:34,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:34,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493461114] [2025-03-17 01:36:34,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:34,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:34,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 01:36:34,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 01:36:34,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:34,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:34,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 01:36:34,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:34,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493461114] [2025-03-17 01:36:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493461114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:36:34,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516924030] [2025-03-17 01:36:34,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:34,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:34,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:34,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:36:34,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 01:36:34,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 01:36:34,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 01:36:34,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:34,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:34,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:36:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:36:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-17 01:36:34,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:36:34,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516924030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:34,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:36:34,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:36:34,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559635997] [2025-03-17 01:36:34,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:34,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:36:34,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:34,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:36:34,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:36:34,927 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 63 states have internal predecessors, (92), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:36:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:34,955 INFO L93 Difference]: Finished difference Result 195 states and 352 transitions. [2025-03-17 01:36:34,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:36:34,957 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2025-03-17 01:36:34,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:34,962 INFO L225 Difference]: With dead ends: 195 [2025-03-17 01:36:34,962 INFO L226 Difference]: Without dead ends: 97 [2025-03-17 01:36:34,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:36:34,971 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:34,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 153 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:36:34,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-17 01:36:35,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-17 01:36:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-17 01:36:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 155 transitions. [2025-03-17 01:36:35,010 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 155 transitions. Word has length 212 [2025-03-17 01:36:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:35,011 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 155 transitions. [2025-03-17 01:36:35,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:36:35,011 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 155 transitions. [2025-03-17 01:36:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 01:36:35,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:35,015 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:35,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:36:35,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-17 01:36:35,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:35,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1528503585, now seen corresponding path program 1 times [2025-03-17 01:36:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:35,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377592881] [2025-03-17 01:36:35,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:35,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:35,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 01:36:35,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 01:36:35,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:35,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:36:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:35,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377592881] [2025-03-17 01:36:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377592881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:36:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234872216] [2025-03-17 01:36:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:35,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:36:35,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:35,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:36:35,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:36:35,590 INFO L87 Difference]: Start difference. First operand 97 states and 155 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:36:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:35,644 INFO L93 Difference]: Finished difference Result 289 states and 463 transitions. [2025-03-17 01:36:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:36:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2025-03-17 01:36:35,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:35,649 INFO L225 Difference]: With dead ends: 289 [2025-03-17 01:36:35,649 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 01:36:35,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 01:36:35,650 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 88 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:35,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 320 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:36:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 01:36:35,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2025-03-17 01:36:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 120 states have (on average 1.4166666666666667) internal successors, (170), 120 states have internal predecessors, (170), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-17 01:36:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 306 transitions. [2025-03-17 01:36:35,685 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 306 transitions. Word has length 212 [2025-03-17 01:36:35,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:35,686 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 306 transitions. [2025-03-17 01:36:35,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:36:35,686 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 306 transitions. [2025-03-17 01:36:35,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-17 01:36:35,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:35,690 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:35,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:36:35,690 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:35,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1258911902, now seen corresponding path program 1 times [2025-03-17 01:36:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:35,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232181439] [2025-03-17 01:36:35,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:35,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-17 01:36:35,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-17 01:36:35,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:35,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:36:36,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:36,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232181439] [2025-03-17 01:36:36,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232181439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:36,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:36,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:36:36,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452310845] [2025-03-17 01:36:36,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:36,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:36:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:36,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:36:36,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:36:36,063 INFO L87 Difference]: Start difference. First operand 191 states and 306 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:36:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:36,250 INFO L93 Difference]: Finished difference Result 504 states and 807 transitions. [2025-03-17 01:36:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:36:36,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2025-03-17 01:36:36,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:36,253 INFO L225 Difference]: With dead ends: 504 [2025-03-17 01:36:36,253 INFO L226 Difference]: Without dead ends: 314 [2025-03-17 01:36:36,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 01:36:36,257 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 112 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:36,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 447 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:36:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-17 01:36:36,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 250. [2025-03-17 01:36:36,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 144 states have internal predecessors, (194), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 01:36:36,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2025-03-17 01:36:36,310 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 212 [2025-03-17 01:36:36,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:36,311 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2025-03-17 01:36:36,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-17 01:36:36,311 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2025-03-17 01:36:36,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-17 01:36:36,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:36,314 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:36,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:36:36,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:36,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1496495119, now seen corresponding path program 1 times [2025-03-17 01:36:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660515362] [2025-03-17 01:36:36,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:36,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:36,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-17 01:36:36,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-17 01:36:36,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:36,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-17 01:36:36,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:36,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660515362] [2025-03-17 01:36:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660515362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:36:36,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:36:36,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 01:36:36,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727850980] [2025-03-17 01:36:36,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:36:36,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:36:36,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:36,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:36:36,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:36:36,840 INFO L87 Difference]: Start difference. First operand 250 states and 398 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:36:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:37,211 INFO L93 Difference]: Finished difference Result 646 states and 1029 transitions. [2025-03-17 01:36:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:36:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213 [2025-03-17 01:36:37,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:37,217 INFO L225 Difference]: With dead ends: 646 [2025-03-17 01:36:37,217 INFO L226 Difference]: Without dead ends: 456 [2025-03-17 01:36:37,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:36:37,220 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 301 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:37,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 651 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:36:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-17 01:36:37,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 438. [2025-03-17 01:36:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 262 states have (on average 1.366412213740458) internal successors, (358), 262 states have internal predecessors, (358), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2025-03-17 01:36:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 698 transitions. [2025-03-17 01:36:37,283 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 698 transitions. Word has length 213 [2025-03-17 01:36:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:37,284 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 698 transitions. [2025-03-17 01:36:37,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:36:37,285 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 698 transitions. [2025-03-17 01:36:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-17 01:36:37,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:37,286 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:37,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:36:37,287 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:37,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:37,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1868416149, now seen corresponding path program 1 times [2025-03-17 01:36:37,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:37,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121953285] [2025-03-17 01:36:37,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:37,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 01:36:37,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 01:36:37,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:37,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:36:37,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [269255591] [2025-03-17 01:36:37,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:37,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:37,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:37,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:36:37,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 01:36:37,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-17 01:36:37,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-17 01:36:37,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:37,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:37,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 01:36:37,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:36:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1113 proven. 39 refuted. 0 times theorem prover too weak. 1092 trivial. 0 not checked. [2025-03-17 01:36:38,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:36:38,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:36:38,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121953285] [2025-03-17 01:36:38,974 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 01:36:38,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269255591] [2025-03-17 01:36:38,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269255591] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:36:38,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:36:38,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-17 01:36:38,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960800893] [2025-03-17 01:36:38,975 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 01:36:38,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:36:38,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:36:38,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:36:38,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 01:36:38,976 INFO L87 Difference]: Start difference. First operand 438 states and 698 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:36:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:36:39,356 INFO L93 Difference]: Finished difference Result 1032 states and 1629 transitions. [2025-03-17 01:36:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 01:36:39,357 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 214 [2025-03-17 01:36:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:36:39,362 INFO L225 Difference]: With dead ends: 1032 [2025-03-17 01:36:39,362 INFO L226 Difference]: Without dead ends: 654 [2025-03-17 01:36:39,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2025-03-17 01:36:39,364 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 143 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:36:39,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 492 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:36:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-17 01:36:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 640. [2025-03-17 01:36:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 391 states have (on average 1.3580562659846547) internal successors, (531), 391 states have internal predecessors, (531), 238 states have call successors, (238), 10 states have call predecessors, (238), 10 states have return successors, (238), 238 states have call predecessors, (238), 238 states have call successors, (238) [2025-03-17 01:36:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1007 transitions. [2025-03-17 01:36:39,451 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1007 transitions. Word has length 214 [2025-03-17 01:36:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:36:39,452 INFO L471 AbstractCegarLoop]: Abstraction has 640 states and 1007 transitions. [2025-03-17 01:36:39,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 6 states have internal predecessors, (53), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-17 01:36:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1007 transitions. [2025-03-17 01:36:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-17 01:36:39,454 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:36:39,454 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:36:39,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:36:39,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:39,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:36:39,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:36:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1123006912, now seen corresponding path program 1 times [2025-03-17 01:36:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:36:39,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097687767] [2025-03-17 01:36:39,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:36:39,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 01:36:39,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 01:36:39,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:39,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 01:36:39,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [674596811] [2025-03-17 01:36:39,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:36:39,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:36:39,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:36:39,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 01:36:39,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 01:36:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-17 01:36:39,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-17 01:36:39,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:36:39,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:36:39,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 01:36:39,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:36:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 345 proven. 489 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-03-17 01:36:42,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:36:54,793 WARN L286 SmtUtils]: Spent 5.85s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 01:37:00,799 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 01:37:21,557 WARN L286 SmtUtils]: Spent 17.60s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-17 01:37:37,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse4 (mod c_~var_1_19~0 4294967296))) (let ((.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse1 (+ .cse4 1)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse5 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse3 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (or (not (= .cse3 .cse0)) (< .cse4 .cse0)) (forall ((v_z_8 Int)) (or (< v_z_8 .cse1) (not (= (mod (* v_z_8 .cse2) 4294967296) v_z_8)) (< v_z_8 .cse5) (< .cse6 v_z_8))) (or (< .cse6 .cse3) (< .cse3 .cse5) (< .cse4 .cse3)))))) is different from false [2025-03-17 01:37:45,311 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-17 01:38:10,493 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)