./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.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 eb317fac4733296e764d15c5d1055d4412d25f784c848e329f8f4334cc494698 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:35:05,851 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:35:05,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:35:05,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:35:05,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:35:05,922 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:35:05,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:35:05,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:35:05,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:35:05,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:35:05,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:35:05,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:35:05,926 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:35:05,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:35:05,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:35:05,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:35:05,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:35:05,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:35:05,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:35:05,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:35:05,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:35:05,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:35:05,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:35:05,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:35:05,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:35:05,929 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 -> eb317fac4733296e764d15c5d1055d4412d25f784c848e329f8f4334cc494698 [2025-03-03 20:35:06,130 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:35:06,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:35:06,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:35:06,141 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:35:06,141 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:35:06,144 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-pe-ci_file-90.i [2025-03-03 20:35:07,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019830ee1/57f5192b7d3042f38125378ed4abf615/FLAG065f65898 [2025-03-03 20:35:07,510 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:35:07,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i [2025-03-03 20:35:07,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019830ee1/57f5192b7d3042f38125378ed4abf615/FLAG065f65898 [2025-03-03 20:35:07,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/019830ee1/57f5192b7d3042f38125378ed4abf615 [2025-03-03 20:35:07,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:35:07,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:35:07,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:35:07,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:35:07,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:35:07,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:35:07" (1/1) ... [2025-03-03 20:35:07,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69659933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:07, skipping insertion in model container [2025-03-03 20:35:07,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:35:07" (1/1) ... [2025-03-03 20:35:07,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:35:07,986 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-pe-ci_file-90.i[919,932] [2025-03-03 20:35:08,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:35:08,054 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:35:08,061 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-pe-ci_file-90.i[919,932] [2025-03-03 20:35:08,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:35:08,115 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:35:08,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08 WrapperNode [2025-03-03 20:35:08,117 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:35:08,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:35:08,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:35:08,118 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:35:08,124 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,177 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2025-03-03 20:35:08,178 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:35:08,179 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:35:08,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:35:08,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:35:08,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,216 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-03 20:35:08,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,228 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,232 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:35:08,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:35:08,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:35:08,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:35:08,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (1/1) ... [2025-03-03 20:35:08,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:35:08,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:35:08,271 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-03 20:35:08,278 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-03 20:35:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:35:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:35:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:35:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:35:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:35:08,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:35:08,363 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:35:08,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:35:08,740 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L206: havoc property_#t~bitwise26#1; [2025-03-03 20:35:08,777 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 20:35:08,777 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:35:08,794 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:35:08,795 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:35:08,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:35:08 BoogieIcfgContainer [2025-03-03 20:35:08,795 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:35:08,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:35:08,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:35:08,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:35:08,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:35:07" (1/3) ... [2025-03-03 20:35:08,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c891923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:35:08, skipping insertion in model container [2025-03-03 20:35:08,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:35:08" (2/3) ... [2025-03-03 20:35:08,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c891923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:35:08, skipping insertion in model container [2025-03-03 20:35:08,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:35:08" (3/3) ... [2025-03-03 20:35:08,802 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i [2025-03-03 20:35:08,812 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:35:08,813 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-90.i that has 2 procedures, 110 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:35:08,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:35:08,875 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;@4cf81959, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:35:08,875 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:35:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:35:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 20:35:08,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:08,895 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:08,896 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:08,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -399705871, now seen corresponding path program 1 times [2025-03-03 20:35:08,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:08,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135766983] [2025-03-03 20:35:08,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:08,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 20:35:09,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 20:35:09,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:09,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-03-03 20:35:09,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:09,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135766983] [2025-03-03 20:35:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135766983] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:35:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117306253] [2025-03-03 20:35:09,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:09,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:35:09,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:35:09,174 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-03 20:35:09,194 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-03 20:35:09,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 20:35:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 20:35:09,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:09,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:09,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:35:09,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:35:09,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2025-03-03 20:35:09,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:35:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117306253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:35:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:35:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738267625] [2025-03-03 20:35:09,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:09,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:35:09,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:09,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:35:09,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:35:09,419 INFO L87 Difference]: Start difference. First operand has 110 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 72 states have internal predecessors, (104), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 20:35:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:09,453 INFO L93 Difference]: Finished difference Result 214 states and 383 transitions. [2025-03-03 20:35:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:35:09,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 227 [2025-03-03 20:35:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:09,460 INFO L225 Difference]: With dead ends: 214 [2025-03-03 20:35:09,460 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 20:35:09,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 228 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-03 20:35:09,464 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:09,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:35:09,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 20:35:09,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-03 20:35:09,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-03 20:35:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 171 transitions. [2025-03-03 20:35:09,499 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 171 transitions. Word has length 227 [2025-03-03 20:35:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:09,499 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 171 transitions. [2025-03-03 20:35:09,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2025-03-03 20:35:09,500 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 171 transitions. [2025-03-03 20:35:09,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 20:35:09,502 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:09,502 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:09,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:35:09,704 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-03 20:35:09,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:09,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash -92932243, now seen corresponding path program 1 times [2025-03-03 20:35:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:09,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842107744] [2025-03-03 20:35:09,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:09,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 20:35:09,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 20:35:09,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:09,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:09,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:35:09,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:09,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842107744] [2025-03-03 20:35:09,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842107744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:09,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:09,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:35:09,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763369585] [2025-03-03 20:35:09,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:09,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:35:09,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:09,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:35:09,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:35:09,943 INFO L87 Difference]: Start difference. First operand 107 states and 171 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:09,993 INFO L93 Difference]: Finished difference Result 263 states and 418 transitions. [2025-03-03 20:35:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:35:09,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-03-03 20:35:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:09,997 INFO L225 Difference]: With dead ends: 263 [2025-03-03 20:35:09,997 INFO L226 Difference]: Without dead ends: 159 [2025-03-03 20:35:09,998 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-03 20:35:10,001 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 74 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:10,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 320 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:35:10,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-03 20:35:10,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2025-03-03 20:35:10,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-03 20:35:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 246 transitions. [2025-03-03 20:35:10,042 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 246 transitions. Word has length 227 [2025-03-03 20:35:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:10,043 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 246 transitions. [2025-03-03 20:35:10,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 246 transitions. [2025-03-03 20:35:10,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 20:35:10,045 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:10,045 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:10,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:35:10,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1900386706, now seen corresponding path program 1 times [2025-03-03 20:35:10,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:10,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765061003] [2025-03-03 20:35:10,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:10,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:10,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 20:35:10,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 20:35:10,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:10,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:35:10,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:10,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765061003] [2025-03-03 20:35:10,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765061003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:10,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:35:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436611296] [2025-03-03 20:35:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:10,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:35:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:10,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:35:10,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:35:10,253 INFO L87 Difference]: Start difference. First operand 156 states and 246 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:10,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:10,323 INFO L93 Difference]: Finished difference Result 399 states and 627 transitions. [2025-03-03 20:35:10,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:35:10,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-03-03 20:35:10,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:10,328 INFO L225 Difference]: With dead ends: 399 [2025-03-03 20:35:10,330 INFO L226 Difference]: Without dead ends: 246 [2025-03-03 20:35:10,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:35:10,332 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 65 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:10,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 321 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:35:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-03-03 20:35:10,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2025-03-03 20:35:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 177 states have (on average 1.463276836158192) internal successors, (259), 180 states have internal predecessors, (259), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 20:35:10,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 379 transitions. [2025-03-03 20:35:10,361 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 379 transitions. Word has length 227 [2025-03-03 20:35:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:10,362 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 379 transitions. [2025-03-03 20:35:10,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2025-03-03 20:35:10,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 20:35:10,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:10,366 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:10,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:35:10,366 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:10,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1689035793, now seen corresponding path program 1 times [2025-03-03 20:35:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534551224] [2025-03-03 20:35:10,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:10,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 20:35:10,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 20:35:10,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:10,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:35:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534551224] [2025-03-03 20:35:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534551224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:10,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:35:10,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036842044] [2025-03-03 20:35:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:10,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:35:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:10,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:35:10,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:35:10,933 INFO L87 Difference]: Start difference. First operand 242 states and 379 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:11,179 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2025-03-03 20:35:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:35:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 227 [2025-03-03 20:35:11,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:11,183 INFO L225 Difference]: With dead ends: 684 [2025-03-03 20:35:11,183 INFO L226 Difference]: Without dead ends: 445 [2025-03-03 20:35:11,183 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-03 20:35:11,184 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 104 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:11,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 464 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:35:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-03-03 20:35:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 415. [2025-03-03 20:35:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 311 states have (on average 1.4855305466237942) internal successors, (462), 314 states have internal predecessors, (462), 96 states have call successors, (96), 7 states have call predecessors, (96), 7 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-03 20:35:11,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 654 transitions. [2025-03-03 20:35:11,244 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 654 transitions. Word has length 227 [2025-03-03 20:35:11,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:11,245 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 654 transitions. [2025-03-03 20:35:11,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:11,245 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 654 transitions. [2025-03-03 20:35:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 20:35:11,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:11,247 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:11,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:35:11,247 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:11,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash -665116623, now seen corresponding path program 1 times [2025-03-03 20:35:11,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:11,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67922627] [2025-03-03 20:35:11,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:11,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:11,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 20:35:11,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 20:35:11,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:11,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:11,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:35:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67922627] [2025-03-03 20:35:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67922627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:11,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:11,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:35:11,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90095689] [2025-03-03 20:35:11,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:11,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:35:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:11,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:35:11,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:35:11,440 INFO L87 Difference]: Start difference. First operand 415 states and 654 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:11,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:11,676 INFO L93 Difference]: Finished difference Result 1177 states and 1857 transitions. [2025-03-03 20:35:11,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:35:11,677 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 229 [2025-03-03 20:35:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:11,682 INFO L225 Difference]: With dead ends: 1177 [2025-03-03 20:35:11,684 INFO L226 Difference]: Without dead ends: 836 [2025-03-03 20:35:11,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:35:11,686 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 167 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:11,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 508 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:35:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2025-03-03 20:35:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 808. [2025-03-03 20:35:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 640 states have (on average 1.4984375) internal successors, (959), 646 states have internal predecessors, (959), 156 states have call successors, (156), 11 states have call predecessors, (156), 11 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 20:35:11,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1271 transitions. [2025-03-03 20:35:11,771 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1271 transitions. Word has length 229 [2025-03-03 20:35:11,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:11,772 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1271 transitions. [2025-03-03 20:35:11,772 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, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1271 transitions. [2025-03-03 20:35:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 20:35:11,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:11,774 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:35:11,775 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash 665218002, now seen corresponding path program 1 times [2025-03-03 20:35:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379450593] [2025-03-03 20:35:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:11,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:35:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:35:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:35:11,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [356751828] [2025-03-03 20:35:11,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:11,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:35:11,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:35:11,885 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-03 20:35:11,887 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-03 20:35:11,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:35:12,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:35:12,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:12,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:12,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 20:35:12,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:35:17,463 WARN L873 $PredicateComparison]: unable to prove that (or (< 4294967264 (mod (div 8 c_~var_1_3~0) 4294967296)) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 0 ~var_1_4~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0)))) is different from true [2025-03-03 20:35:19,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:35:19,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:35:19,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379450593] [2025-03-03 20:35:19,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:35:19,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356751828] [2025-03-03 20:35:19,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356751828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:19,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:19,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:35:19,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338707322] [2025-03-03 20:35:19,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:19,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:35:19,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:19,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:35:19,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-03-03 20:35:19,623 INFO L87 Difference]: Start difference. First operand 808 states and 1271 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:38,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 20:35:42,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 20:35:43,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:35:43,457 INFO L93 Difference]: Finished difference Result 1124 states and 1743 transitions. [2025-03-03 20:35:43,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 20:35:43,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2025-03-03 20:35:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:35:43,466 INFO L225 Difference]: With dead ends: 1124 [2025-03-03 20:35:43,467 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 20:35:43,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=4, NotChecked=18, Total=132 [2025-03-03 20:35:43,469 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 178 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 74 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 348 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2025-03-03 20:35:43,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 743 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 189 Invalid, 2 Unknown, 348 Unchecked, 9.9s Time] [2025-03-03 20:35:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 20:35:43,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 824. [2025-03-03 20:35:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 656 states have (on average 1.5030487804878048) internal successors, (986), 662 states have internal predecessors, (986), 156 states have call successors, (156), 11 states have call predecessors, (156), 11 states have return successors, (156), 150 states have call predecessors, (156), 156 states have call successors, (156) [2025-03-03 20:35:43,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1298 transitions. [2025-03-03 20:35:43,526 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1298 transitions. Word has length 231 [2025-03-03 20:35:43,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:35:43,527 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1298 transitions. [2025-03-03 20:35:43,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:35:43,527 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1298 transitions. [2025-03-03 20:35:43,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 20:35:43,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:35:43,529 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:35:43,537 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-03 20:35:43,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-03 20:35:43,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:35:43,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:35:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash 794300721, now seen corresponding path program 1 times [2025-03-03 20:35:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:35:43,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048402118] [2025-03-03 20:35:43,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:43,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:35:43,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:35:43,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:35:43,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:43,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:35:43,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [127444571] [2025-03-03 20:35:43,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:35:43,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:35:43,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:35:43,803 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-03 20:35:43,804 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-03 20:35:43,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:35:43,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:35:43,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:35:43,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:35:43,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 20:35:43,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:35:50,889 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 1 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 1 (mod (div 8 ~var_1_4~0) 4294967296)) (<= 0 ~var_1_4~0))) (< 0 (mod (div 8 c_~var_1_3~0) 4294967296))) is different from true [2025-03-03 20:35:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:35:53,300 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:35:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:35:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048402118] [2025-03-03 20:35:53,300 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:35:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127444571] [2025-03-03 20:35:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127444571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:35:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:35:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:35:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511117810] [2025-03-03 20:35:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:35:53,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:35:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:35:53,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:35:53,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2025-03-03 20:35:53,301 INFO L87 Difference]: Start difference. First operand 824 states and 1298 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:36:03,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 20:36:07,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-03-03 20:36:09,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 20:36:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:09,189 INFO L93 Difference]: Finished difference Result 1916 states and 3015 transitions. [2025-03-03 20:36:09,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:36:09,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 231 [2025-03-03 20:36:09,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:09,200 INFO L225 Difference]: With dead ends: 1916 [2025-03-03 20:36:09,200 INFO L226 Difference]: Without dead ends: 1672 [2025-03-03 20:36:09,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=25, Invalid=33, Unknown=2, NotChecked=12, Total=72 [2025-03-03 20:36:09,205 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 214 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 73 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:09,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 689 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 77 Invalid, 2 Unknown, 409 Unchecked, 10.2s Time] [2025-03-03 20:36:09,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1672 states. [2025-03-03 20:36:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1672 to 1498. [2025-03-03 20:36:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1498 states, 1202 states have (on average 1.5074875207986689) internal successors, (1812), 1214 states have internal predecessors, (1812), 276 states have call successors, (276), 19 states have call predecessors, (276), 19 states have return successors, (276), 264 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-03 20:36:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 2364 transitions. [2025-03-03 20:36:09,296 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 2364 transitions. Word has length 231 [2025-03-03 20:36:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:09,297 INFO L471 AbstractCegarLoop]: Abstraction has 1498 states and 2364 transitions. [2025-03-03 20:36:09,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-03-03 20:36:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 2364 transitions. [2025-03-03 20:36:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 20:36:09,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:09,302 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:36:09,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 20:36:09,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:36:09,503 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:09,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash 159659377, now seen corresponding path program 1 times [2025-03-03 20:36:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:09,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658299105] [2025-03-03 20:36:09,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:09,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:36:09,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:36:09,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:09,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:09,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-03 20:36:09,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658299105] [2025-03-03 20:36:09,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658299105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:36:09,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884114202] [2025-03-03 20:36:09,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:09,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:36:09,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:36:09,884 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:36:09,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 20:36:09,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:36:10,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:36:10,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:10,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:10,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:36:10,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1275 proven. 45 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 20:36:12,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:36:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 60 proven. 45 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2025-03-03 20:36:14,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884114202] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:36:14,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:36:14,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:36:14,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103132412] [2025-03-03 20:36:14,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:36:14,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:36:14,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:14,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:36:14,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:36:14,175 INFO L87 Difference]: Start difference. First operand 1498 states and 2364 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-03 20:36:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:16,527 INFO L93 Difference]: Finished difference Result 2834 states and 4436 transitions. [2025-03-03 20:36:16,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:36:16,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 231 [2025-03-03 20:36:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:16,537 INFO L225 Difference]: With dead ends: 2834 [2025-03-03 20:36:16,537 INFO L226 Difference]: Without dead ends: 1540 [2025-03-03 20:36:16,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 459 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:36:16,541 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 91 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:16,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 378 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 20:36:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2025-03-03 20:36:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1518. [2025-03-03 20:36:16,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1217 states have (on average 1.4691865242399342) internal successors, (1788), 1229 states have internal predecessors, (1788), 276 states have call successors, (276), 24 states have call predecessors, (276), 24 states have return successors, (276), 264 states have call predecessors, (276), 276 states have call successors, (276) [2025-03-03 20:36:16,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 2340 transitions. [2025-03-03 20:36:16,628 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 2340 transitions. Word has length 231 [2025-03-03 20:36:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:16,630 INFO L471 AbstractCegarLoop]: Abstraction has 1518 states and 2340 transitions. [2025-03-03 20:36:16,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (51), 2 states have call predecessors, (51), 4 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2025-03-03 20:36:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 2340 transitions. [2025-03-03 20:36:16,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 20:36:16,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:16,633 INFO L218 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:36:16,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 20:36:16,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:36:16,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:16,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 154683825, now seen corresponding path program 1 times [2025-03-03 20:36:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844030925] [2025-03-03 20:36:16,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:16,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:36:16,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:36:16,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:16,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:36:16,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [689768939] [2025-03-03 20:36:16,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:16,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:36:16,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:36:16,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:36:16,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 20:36:16,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 20:36:17,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 20:36:17,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:17,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:17,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 20:36:17,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:29,662 WARN L873 $PredicateComparison]: unable to prove that (or (< 4294967264 (mod (div 8 c_~var_1_3~0) 4294967296)) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 0 ~var_1_4~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)))) (exists ((~var_1_4~0 Int)) (and (<= ~var_1_4~0 c_~var_1_3~0) (<= 4294967265 (mod (div 8 ~var_1_4~0) 4294967296)) (<= (+ ~var_1_4~0 1) 0)))) is different from true [2025-03-03 20:36:33,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2025-03-03 20:36:33,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:36:33,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844030925] [2025-03-03 20:36:33,630 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 20:36:33,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689768939] [2025-03-03 20:36:33,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689768939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:36:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731855594] [2025-03-03 20:36:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:33,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:36:33,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:33,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:36:33,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2025-03-03 20:36:33,631 INFO L87 Difference]: Start difference. First operand 1518 states and 2340 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36)