./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.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_fillercodesize_normal_file-4.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:12:56,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:12:56,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:12:56,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:12:56,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:12:56,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:12:56,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:12:56,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:12:56,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:12:56,933 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:12:56,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:12:56,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:12:56,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:12:56,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:12:56,934 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:12:56,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:12:56,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:12:56,935 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:12:56,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:12:56,935 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:12:56,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:12:56,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:12:56,936 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:12:56,936 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:12:56,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:12:56,937 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:12:56,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:12:56,938 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2025-03-03 19:12:57,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:12:57,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:12:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:12:57,175 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:12:57,175 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:12:57,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2025-03-03 19:12:58,277 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b4b9ae0/25d927c61d2c4265b186061b271085ba/FLAG46a8a6511 [2025-03-03 19:12:58,520 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:12:58,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2025-03-03 19:12:58,529 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b4b9ae0/25d927c61d2c4265b186061b271085ba/FLAG46a8a6511 [2025-03-03 19:12:58,848 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72b4b9ae0/25d927c61d2c4265b186061b271085ba [2025-03-03 19:12:58,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:12:58,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:12:58,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:12:58,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:12:58,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:12:58,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:12:58" (1/1) ... [2025-03-03 19:12:58,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15fe0a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:58, skipping insertion in model container [2025-03-03 19:12:58,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:12:58" (1/1) ... [2025-03-03 19:12:58,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:12:58,967 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_fillercodesize_normal_file-4.i[912,925] [2025-03-03 19:12:59,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:12:59,032 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:12:59,040 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_fillercodesize_normal_file-4.i[912,925] [2025-03-03 19:12:59,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:12:59,091 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:12:59,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59 WrapperNode [2025-03-03 19:12:59,091 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:12:59,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:12:59,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:12:59,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:12:59,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,131 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2025-03-03 19:12:59,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:12:59,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:12:59,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:12:59,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:12:59,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,163 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 19:12:59,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,176 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:12:59,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:12:59,188 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:12:59,188 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:12:59,189 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (1/1) ... [2025-03-03 19:12:59,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:12:59,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:12:59,214 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 19:12:59,219 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 19:12:59,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:12:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:12:59,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:12:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:12:59,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:12:59,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:12:59,294 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:12:59,295 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:12:59,500 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:12:59,500 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:12:59,506 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:12:59,507 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:12:59,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:12:59 BoogieIcfgContainer [2025-03-03 19:12:59,507 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:12:59,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:12:59,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:12:59,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:12:59,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:12:58" (1/3) ... [2025-03-03 19:12:59,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1725a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:12:59, skipping insertion in model container [2025-03-03 19:12:59,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:12:59" (2/3) ... [2025-03-03 19:12:59,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1725a90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:12:59, skipping insertion in model container [2025-03-03 19:12:59,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:12:59" (3/3) ... [2025-03-03 19:12:59,515 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-4.i [2025-03-03 19:12:59,524 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:12:59,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-4.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:12:59,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:12:59,579 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;@6ac76b18, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:12:59,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:12:59,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:12:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:12:59,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:12:59,594 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:12:59,594 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:12:59,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:12:59,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1425709298, now seen corresponding path program 1 times [2025-03-03 19:12:59,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:12:59,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016588710] [2025-03-03 19:12:59,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:59,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:12:59,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:12:59,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:12:59,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:59,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 19:12:59,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:12:59,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016588710] [2025-03-03 19:12:59,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016588710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:12:59,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501180747] [2025-03-03 19:12:59,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:12:59,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:12:59,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:12:59,788 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 19:12:59,790 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 19:12:59,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:12:59,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:12:59,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:12:59,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:12:59,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:12:59,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:12:59,960 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 19:12:59,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:12:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501180747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:12:59,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:12:59,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:12:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117306406] [2025-03-03 19:12:59,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:12:59,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:12:59,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:12:59,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:12:59,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:12:59,986 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:13:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:00,002 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2025-03-03 19:13:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:13:00,003 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-03 19:13:00,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:00,007 INFO L225 Difference]: With dead ends: 120 [2025-03-03 19:13:00,007 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 19:13:00,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 19:13:00,011 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:00,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:13:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 19:13:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 19:13:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:13:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-03-03 19:13:00,045 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-03-03 19:13:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:00,046 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-03-03 19:13:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:13:00,046 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-03-03 19:13:00,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:13:00,048 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:00,049 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:00,055 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 19:13:00,249 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 19:13:00,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:00,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:00,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1302889807, now seen corresponding path program 1 times [2025-03-03 19:13:00,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:00,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499279094] [2025-03-03 19:13:00,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:00,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:00,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:13:00,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:13:00,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:00,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:01,066 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:01,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:01,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499279094] [2025-03-03 19:13:01,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499279094] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:01,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:01,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:13:01,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397201819] [2025-03-03 19:13:01,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:01,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:13:01,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:01,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:13:01,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:13:01,069 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:01,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:01,280 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2025-03-03 19:13:01,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:13:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-03 19:13:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:01,282 INFO L225 Difference]: With dead ends: 201 [2025-03-03 19:13:01,284 INFO L226 Difference]: Without dead ends: 144 [2025-03-03 19:13:01,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:13:01,285 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 134 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:01,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 335 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:13:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-03 19:13:01,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 119. [2025-03-03 19:13:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 76 states have internal predecessors, (98), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 19:13:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 178 transitions. [2025-03-03 19:13:01,310 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 178 transitions. Word has length 130 [2025-03-03 19:13:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:01,311 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 178 transitions. [2025-03-03 19:13:01,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 178 transitions. [2025-03-03 19:13:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:13:01,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:01,314 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:01,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:13:01,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1301966286, now seen corresponding path program 1 times [2025-03-03 19:13:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027954424] [2025-03-03 19:13:01,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:01,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:13:01,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:13:01,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:01,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:05,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:05,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027954424] [2025-03-03 19:13:05,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027954424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:05,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:05,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 19:13:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955178833] [2025-03-03 19:13:05,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:05,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 19:13:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:05,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 19:13:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:13:05,553 INFO L87 Difference]: Start difference. First operand 119 states and 178 transitions. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:06,640 INFO L93 Difference]: Finished difference Result 401 states and 585 transitions. [2025-03-03 19:13:06,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 19:13:06,640 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-03 19:13:06,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:06,643 INFO L225 Difference]: With dead ends: 401 [2025-03-03 19:13:06,645 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 19:13:06,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 19:13:06,649 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 186 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:06,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 440 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:13:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 19:13:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 190. [2025-03-03 19:13:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 125 states have (on average 1.272) internal successors, (159), 125 states have internal predecessors, (159), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 19:13:06,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 279 transitions. [2025-03-03 19:13:06,675 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 279 transitions. Word has length 130 [2025-03-03 19:13:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:06,675 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 279 transitions. [2025-03-03 19:13:06,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 279 transitions. [2025-03-03 19:13:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:13:06,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:06,677 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:06,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:13:06,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:06,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1172883567, now seen corresponding path program 1 times [2025-03-03 19:13:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:06,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79979979] [2025-03-03 19:13:06,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:06,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:06,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:13:06,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:13:06,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:06,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:06,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:06,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79979979] [2025-03-03 19:13:06,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79979979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:06,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:06,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:13:06,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733331808] [2025-03-03 19:13:06,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:06,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:13:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:06,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:13:06,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:13:06,839 INFO L87 Difference]: Start difference. First operand 190 states and 279 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:06,895 INFO L93 Difference]: Finished difference Result 429 states and 638 transitions. [2025-03-03 19:13:06,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:13:06,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2025-03-03 19:13:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:06,898 INFO L225 Difference]: With dead ends: 429 [2025-03-03 19:13:06,898 INFO L226 Difference]: Without dead ends: 306 [2025-03-03 19:13:06,899 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 19:13:06,899 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:06,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 174 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:13:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-03-03 19:13:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2025-03-03 19:13:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 197 states have (on average 1.263959390862944) internal successors, (249), 197 states have internal predecessors, (249), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 19:13:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 449 transitions. [2025-03-03 19:13:06,949 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 449 transitions. Word has length 130 [2025-03-03 19:13:06,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:06,949 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 449 transitions. [2025-03-03 19:13:06,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 449 transitions. [2025-03-03 19:13:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:06,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:06,950 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:06,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:13:06,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:06,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1909563764, now seen corresponding path program 1 times [2025-03-03 19:13:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955000376] [2025-03-03 19:13:06,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:06,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:07,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:07,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:07,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:07,142 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 19:13:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955000376] [2025-03-03 19:13:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955000376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:13:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658739168] [2025-03-03 19:13:07,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:07,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:13:07,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:13:07,145 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 19:13:07,147 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 19:13:07,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:07,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:07,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:07,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:07,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:13:07,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 217 proven. 48 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 19:13:07,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:13:07,585 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 48 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 19:13:07,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658739168] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:13:07,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:13:07,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 19:13:07,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657930726] [2025-03-03 19:13:07,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:13:07,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 19:13:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:07,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 19:13:07,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:13:07,587 INFO L87 Difference]: Start difference. First operand 304 states and 449 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 19:13:07,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:07,733 INFO L93 Difference]: Finished difference Result 563 states and 809 transitions. [2025-03-03 19:13:07,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 19:13:07,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 131 [2025-03-03 19:13:07,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:07,736 INFO L225 Difference]: With dead ends: 563 [2025-03-03 19:13:07,736 INFO L226 Difference]: Without dead ends: 329 [2025-03-03 19:13:07,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 259 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 19:13:07,737 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 61 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:07,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 131 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:13:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-03 19:13:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 293. [2025-03-03 19:13:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 181 states have (on average 1.132596685082873) internal successors, (205), 181 states have internal predecessors, (205), 100 states have call successors, (100), 11 states have call predecessors, (100), 11 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 19:13:07,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 405 transitions. [2025-03-03 19:13:07,772 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 405 transitions. Word has length 131 [2025-03-03 19:13:07,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:07,772 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 405 transitions. [2025-03-03 19:13:07,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2025-03-03 19:13:07,773 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 405 transitions. [2025-03-03 19:13:07,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:07,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:07,774 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:07,781 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 19:13:07,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:13:07,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:07,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash -559630220, now seen corresponding path program 1 times [2025-03-03 19:13:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602768578] [2025-03-03 19:13:07,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:07,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:08,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:08,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:08,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:08,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:08,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602768578] [2025-03-03 19:13:08,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602768578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:08,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:08,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:13:08,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286860674] [2025-03-03 19:13:08,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:08,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:13:08,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:08,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:13:08,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:13:08,076 INFO L87 Difference]: Start difference. First operand 293 states and 405 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:08,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:08,208 INFO L93 Difference]: Finished difference Result 520 states and 722 transitions. [2025-03-03 19:13:08,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:13:08,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 19:13:08,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:08,211 INFO L225 Difference]: With dead ends: 520 [2025-03-03 19:13:08,211 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 19:13:08,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 19:13:08,212 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 84 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:08,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 299 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:13:08,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 19:13:08,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 399. [2025-03-03 19:13:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 243 states have (on average 1.1193415637860082) internal successors, (272), 243 states have internal predecessors, (272), 140 states have call successors, (140), 15 states have call predecessors, (140), 15 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-03-03 19:13:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 552 transitions. [2025-03-03 19:13:08,255 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 552 transitions. Word has length 131 [2025-03-03 19:13:08,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:08,255 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 552 transitions. [2025-03-03 19:13:08,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 552 transitions. [2025-03-03 19:13:08,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:08,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:08,257 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:08,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 19:13:08,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:08,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:08,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1927882613, now seen corresponding path program 1 times [2025-03-03 19:13:08,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:08,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335481610] [2025-03-03 19:13:08,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:08,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:08,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:08,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:08,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:08,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:08,943 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 60 proven. 93 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2025-03-03 19:13:08,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335481610] [2025-03-03 19:13:08,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335481610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:13:08,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809743089] [2025-03-03 19:13:08,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:08,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:13:08,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:13:08,945 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 19:13:08,948 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 19:13:08,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:09,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:09,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:09,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:09,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 19:13:09,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 367 proven. 111 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 19:13:10,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:13:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 48 proven. 63 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-03 19:13:10,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809743089] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:13:10,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:13:10,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 28 [2025-03-03 19:13:10,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227209706] [2025-03-03 19:13:10,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:13:10,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 19:13:10,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:10,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 19:13:10,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2025-03-03 19:13:10,630 INFO L87 Difference]: Start difference. First operand 399 states and 552 transitions. Second operand has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 10 states have call successors, (60) [2025-03-03 19:13:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:13,114 INFO L93 Difference]: Finished difference Result 722 states and 921 transitions. [2025-03-03 19:13:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-03 19:13:13,114 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 10 states have call successors, (60) Word has length 131 [2025-03-03 19:13:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:13,117 INFO L225 Difference]: With dead ends: 722 [2025-03-03 19:13:13,117 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 19:13:13,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2331 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1987, Invalid=6203, Unknown=0, NotChecked=0, Total=8190 [2025-03-03 19:13:13,120 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 985 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 736 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 736 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:13,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 446 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [736 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 19:13:13,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 19:13:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 332. [2025-03-03 19:13:13,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 214 states have (on average 1.088785046728972) internal successors, (233), 215 states have internal predecessors, (233), 88 states have call successors, (88), 29 states have call predecessors, (88), 29 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 19:13:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 409 transitions. [2025-03-03 19:13:13,161 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 409 transitions. Word has length 131 [2025-03-03 19:13:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:13,161 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 409 transitions. [2025-03-03 19:13:13,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5185185185185186) internal successors, (95), 26 states have internal predecessors, (95), 10 states have call successors, (60), 4 states have call predecessors, (60), 8 states have return successors, (60), 10 states have call predecessors, (60), 10 states have call successors, (60) [2025-03-03 19:13:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 409 transitions. [2025-03-03 19:13:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:13,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:13,164 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:13,170 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 19:13:13,364 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 19:13:13,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:13,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:13,365 INFO L85 PathProgramCache]: Analyzing trace with hash -616557902, now seen corresponding path program 1 times [2025-03-03 19:13:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:13,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755769053] [2025-03-03 19:13:13,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:13,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:13,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:13,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:13,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:13,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:13,541 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 19:13:13,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755769053] [2025-03-03 19:13:13,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755769053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:13:13,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474181273] [2025-03-03 19:13:13,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:13,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:13:13,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:13:13,544 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 19:13:13,550 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 19:13:13,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:13,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:13,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:13,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:13,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:13:13,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2025-03-03 19:13:13,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:13:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 19:13:13,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474181273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:13:13,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 19:13:13,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-03 19:13:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870487019] [2025-03-03 19:13:13,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 19:13:13,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 19:13:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:13,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 19:13:13,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 19:13:13,958 INFO L87 Difference]: Start difference. First operand 332 states and 409 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 19:13:14,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:14,282 INFO L93 Difference]: Finished difference Result 769 states and 928 transitions. [2025-03-03 19:13:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 19:13:14,282 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 131 [2025-03-03 19:13:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:14,285 INFO L225 Difference]: With dead ends: 769 [2025-03-03 19:13:14,286 INFO L226 Difference]: Without dead ends: 506 [2025-03-03 19:13:14,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 257 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2025-03-03 19:13:14,287 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:14,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 352 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:13:14,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-03 19:13:14,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 352. [2025-03-03 19:13:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 231 states have (on average 1.0822510822510822) internal successors, (250), 232 states have internal predecessors, (250), 88 states have call successors, (88), 32 states have call predecessors, (88), 32 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88) [2025-03-03 19:13:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 426 transitions. [2025-03-03 19:13:14,326 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 426 transitions. Word has length 131 [2025-03-03 19:13:14,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:14,327 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 426 transitions. [2025-03-03 19:13:14,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-03 19:13:14,327 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 426 transitions. [2025-03-03 19:13:14,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:14,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:14,328 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:14,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 19:13:14,528 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 19:13:14,529 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:14,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash -615634381, now seen corresponding path program 1 times [2025-03-03 19:13:14,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:14,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443288884] [2025-03-03 19:13:14,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:14,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:14,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:14,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:14,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:14,595 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:14,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:13:14,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443288884] [2025-03-03 19:13:14,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443288884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:14,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:14,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:13:14,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429357891] [2025-03-03 19:13:14,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:14,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 19:13:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:13:14,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 19:13:14,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 19:13:14,597 INFO L87 Difference]: Start difference. First operand 352 states and 426 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:14,641 INFO L93 Difference]: Finished difference Result 563 states and 681 transitions. [2025-03-03 19:13:14,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 19:13:14,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 19:13:14,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:14,643 INFO L225 Difference]: With dead ends: 563 [2025-03-03 19:13:14,644 INFO L226 Difference]: Without dead ends: 268 [2025-03-03 19:13:14,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 19:13:14,645 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:14,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:13:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-03 19:13:14,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-03 19:13:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 174 states have (on average 1.0574712643678161) internal successors, (184), 175 states have internal predecessors, (184), 68 states have call successors, (68), 25 states have call predecessors, (68), 25 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-03 19:13:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 320 transitions. [2025-03-03 19:13:14,675 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 320 transitions. Word has length 131 [2025-03-03 19:13:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:14,676 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 320 transitions. [2025-03-03 19:13:14,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 320 transitions. [2025-03-03 19:13:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 19:13:14,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:14,677 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:14,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 19:13:14,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:14,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:14,677 INFO L85 PathProgramCache]: Analyzing trace with hash -758177645, now seen corresponding path program 1 times [2025-03-03 19:13:14,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:13:14,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152083636] [2025-03-03 19:13:14,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:14,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:13:14,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:13:14,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:13:14,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:14,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:13:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451912753] [2025-03-03 19:13:14,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:14,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:13:14,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:13:14,744 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 19:13:14,746 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 19:13:14,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:13:14,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:13:14,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:14,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:13:14,925 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:13:14,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:13:14,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:13:14,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:14,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:13:15,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:13:15,013 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:13:15,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:13:15,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 19:13:15,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 19:13:15,219 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:15,304 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:13:15,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:13:15 BoogieIcfgContainer [2025-03-03 19:13:15,312 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:13:15,312 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:13:15,312 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:13:15,313 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:13:15,313 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:12:59" (3/4) ... [2025-03-03 19:13:15,315 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:13:15,315 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:13:15,316 INFO L158 Benchmark]: Toolchain (without parser) took 16465.14ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 110.6MB in the beginning and 241.1MB in the end (delta: -130.6MB). Peak memory consumption was 105.7MB. Max. memory is 16.1GB. [2025-03-03 19:13:15,316 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:13:15,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.23ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 96.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:13:15,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.28ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:13:15,317 INFO L158 Benchmark]: Boogie Preprocessor took 51.30ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 90.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:13:15,318 INFO L158 Benchmark]: IcfgBuilder took 322.41ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 69.4MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 19:13:15,318 INFO L158 Benchmark]: TraceAbstraction took 15803.46ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 68.9MB in the beginning and 241.2MB in the end (delta: -172.3MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2025-03-03 19:13:15,318 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 377.5MB. Free memory was 241.2MB in the beginning and 241.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:13:15,319 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.23ms. Allocated memory is still 142.6MB. Free memory was 110.1MB in the beginning and 96.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.28ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.0MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.30ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 90.6MB in the end (delta: 3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 322.41ms. Allocated memory is still 142.6MB. Free memory was 90.6MB in the beginning and 69.4MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15803.46ms. Allocated memory was 142.6MB in the beginning and 377.5MB in the end (delta: 234.9MB). Free memory was 68.9MB in the beginning and 241.2MB in the end (delta: -172.3MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 377.5MB. Free memory was 241.2MB in the beginning and 241.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 76, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] unsigned short int last_1_var_1_6 = 4; [L40] unsigned short int last_1_var_1_9 = 4; [L41] unsigned long int last_1_var_1_14 = 500; [L42] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] isInitial = 1 [L136] FCALL initially() [L137] COND TRUE 1 [L138] CALL updateLastVariables() [L125] last_1_var_1_6 = var_1_6 [L126] last_1_var_1_9 = var_1_9 [L127] last_1_var_1_14 = var_1_14 [L128] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] RET updateLastVariables() [L139] CALL updateVariables() [L92] var_1_4 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L93] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_9=4] [L94] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L95] var_1_5 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L101] var_1_12 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L102] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L103] var_1_13 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L104] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L105] var_1_15 = __VERIFIER_nondet_ulong() [L106] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L106] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L107] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L108] var_1_16 = __VERIFIER_nondet_ulong() [L109] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L109] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L110] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L111] var_1_19 = __VERIFIER_nondet_short() [L112] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L112] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L113] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L114] var_1_20 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L117] var_1_21 = __VERIFIER_nondet_short() [L118] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] var_1_22 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET updateVariables() [L140] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L47] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L52] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L53] COND TRUE last_1_var_1_14 >= stepLocal_3 [L54] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L56] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L57] COND TRUE (- var_1_14) > var_1_6 [L58] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L63] unsigned char stepLocal_2 = var_1_4; [L64] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L65] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=3221225454, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND TRUE stepLocal_1 >= var_1_6 [L69] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L74] unsigned char stepLocal_5 = var_1_1; [L75] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L76] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L83] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L84] COND TRUE ! var_1_1 [L85] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L140] RET step() [L141] CALL, EXPR property() [L131-L132] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L141] RET, EXPR property() [L141] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=3221225454, var_1_15=3221225470, var_1_16=3221225470, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.7s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1643 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1639 mSDsluCounter, 2342 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1478 mSDsCounter, 871 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1739 IncrementalHoareTripleChecker+Invalid, 2610 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 871 mSolverCounterUnsat, 864 mSDtfsCounter, 1739 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1078 GetRequests, 933 SyntacticMatches, 5 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2419 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=6, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 474 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2073 ConstructedInterpolants, 0 QuantifiedInterpolants, 10529 SizeOfPredicates, 18 NumberOfNonLiveVariables, 1248 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 11549/12160 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 19:13:15,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_fillercodesize_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:13:17,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:13:17,302 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:13:17,306 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:13:17,306 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:13:17,331 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:13:17,332 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:13:17,333 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:13:17,333 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:13:17,333 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:13:17,334 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:13:17,334 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:13:17,334 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:13:17,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:13:17,335 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:13:17,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:13:17,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:13:17,335 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:13:17,335 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:13:17,336 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:13:17,337 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:13:17,337 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:13:17,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:13:17,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:13:17,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:13:17,337 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:13:17,337 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:13:17,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:13:17,338 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 -> 7eb5dc1b7263248dec04a91cd00b36ee3893c5f231e0b2c2e0e4f773eb58e04d [2025-03-03 19:13:17,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:13:17,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:13:17,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:13:17,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:13:17,602 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:13:17,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2025-03-03 19:13:18,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192d19a9e/88c25545f15c46fca379d59c626c9152/FLAG35b808233 [2025-03-03 19:13:19,026 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:13:19,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-4.i [2025-03-03 19:13:19,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192d19a9e/88c25545f15c46fca379d59c626c9152/FLAG35b808233 [2025-03-03 19:13:19,381 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192d19a9e/88c25545f15c46fca379d59c626c9152 [2025-03-03 19:13:19,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:13:19,385 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:13:19,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:13:19,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:13:19,390 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:13:19,391 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@426e788f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19, skipping insertion in model container [2025-03-03 19:13:19,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,409 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:13:19,506 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_fillercodesize_normal_file-4.i[912,925] [2025-03-03 19:13:19,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:13:19,556 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:13:19,564 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_fillercodesize_normal_file-4.i[912,925] [2025-03-03 19:13:19,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:13:19,594 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:13:19,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19 WrapperNode [2025-03-03 19:13:19,595 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:13:19,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:13:19,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:13:19,596 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:13:19,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,609 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,633 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2025-03-03 19:13:19,633 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:13:19,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:13:19,634 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:13:19,634 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:13:19,641 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,648 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,657 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 19:13:19,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,669 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:13:19,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:13:19,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:13:19,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:13:19,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (1/1) ... [2025-03-03 19:13:19,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:13:19,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:13:19,700 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 19:13:19,705 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 19:13:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:13:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:13:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:13:19,723 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:13:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:13:19,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:13:19,780 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:13:19,782 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:13:20,441 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 19:13:20,441 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:13:20,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:13:20,450 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:13:20,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:13:20 BoogieIcfgContainer [2025-03-03 19:13:20,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:13:20,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:13:20,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:13:20,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:13:20,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:13:19" (1/3) ... [2025-03-03 19:13:20,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3b83e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:13:20, skipping insertion in model container [2025-03-03 19:13:20,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:13:19" (2/3) ... [2025-03-03 19:13:20,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3b83e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:13:20, skipping insertion in model container [2025-03-03 19:13:20,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:13:20" (3/3) ... [2025-03-03 19:13:20,459 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-4.i [2025-03-03 19:13:20,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:13:20,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_normal_file-4.i that has 2 procedures, 63 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:13:20,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:13:20,528 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;@3447789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:13:20,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:13:20,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:13:20,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 19:13:20,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:20,539 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:20,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:20,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:20,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1425709298, now seen corresponding path program 1 times [2025-03-03 19:13:20,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:13:20,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499421299] [2025-03-03 19:13:20,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:20,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:20,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:13:20,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:13:20,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 19:13:20,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 19:13:20,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 19:13:20,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:20,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:20,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:13:20,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2025-03-03 19:13:20,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:13:20,830 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:13:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499421299] [2025-03-03 19:13:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499421299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:20,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:20,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:13:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642374760] [2025-03-03 19:13:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:20,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:13:20,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:13:20,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:13:20,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:13:20,854 INFO L87 Difference]: Start difference. First operand has 63 states, 40 states have (on average 1.375) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:13:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:20,876 INFO L93 Difference]: Finished difference Result 120 states and 205 transitions. [2025-03-03 19:13:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:13:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2025-03-03 19:13:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:20,881 INFO L225 Difference]: With dead ends: 120 [2025-03-03 19:13:20,881 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 19:13:20,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 19:13:20,885 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:20,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:13:20,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 19:13:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-03 19:13:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:13:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2025-03-03 19:13:20,918 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 129 [2025-03-03 19:13:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:20,918 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2025-03-03 19:13:20,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 19:13:20,919 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2025-03-03 19:13:20,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 19:13:20,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:20,921 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:20,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 19:13:21,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:21,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:21,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:21,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1302889807, now seen corresponding path program 1 times [2025-03-03 19:13:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:13:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420935648] [2025-03-03 19:13:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:21,123 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:21,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:13:21,125 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:13:21,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 19:13:21,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 19:13:21,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 19:13:21,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:21,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:21,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-03 19:13:21,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:21,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 179 proven. 99 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2025-03-03 19:13:21,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:13:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 9 proven. 102 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-03 19:13:22,508 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:13:22,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420935648] [2025-03-03 19:13:22,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420935648] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 19:13:22,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:13:22,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2025-03-03 19:13:22,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480941165] [2025-03-03 19:13:22,508 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:13:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 19:13:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:13:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 19:13:22,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-03-03 19:13:22,510 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-03 19:13:23,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:23,782 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2025-03-03 19:13:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 19:13:23,785 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 130 [2025-03-03 19:13:23,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:23,786 INFO L225 Difference]: With dead ends: 143 [2025-03-03 19:13:23,786 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 19:13:23,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2025-03-03 19:13:23,787 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 58 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:23,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 228 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 19:13:23,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 19:13:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2025-03-03 19:13:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 19:13:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2025-03-03 19:13:23,800 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 130 [2025-03-03 19:13:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:23,800 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2025-03-03 19:13:23,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2025-03-03 19:13:23,800 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2025-03-03 19:13:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:23,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:23,802 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:23,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-03 19:13:24,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:24,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:24,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:24,003 INFO L85 PathProgramCache]: Analyzing trace with hash -559630220, now seen corresponding path program 1 times [2025-03-03 19:13:24,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:13:24,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9371056] [2025-03-03 19:13:24,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:24,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:24,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:13:24,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:13:24,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 19:13:24,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:24,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:24,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:24,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:24,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:13:24,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:24,415 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:24,415 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:13:24,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:13:24,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9371056] [2025-03-03 19:13:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9371056] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:24,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:24,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:13:24,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644371776] [2025-03-03 19:13:24,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:24,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:13:24,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:13:24,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:13:24,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:13:24,418 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:25,216 INFO L93 Difference]: Finished difference Result 203 states and 269 transitions. [2025-03-03 19:13:25,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:13:25,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 19:13:25,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:25,219 INFO L225 Difference]: With dead ends: 203 [2025-03-03 19:13:25,219 INFO L226 Difference]: Without dead ends: 134 [2025-03-03 19:13:25,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:13:25,220 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 92 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:25,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 212 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:13:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-03 19:13:25,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2025-03-03 19:13:25,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 85 states have (on average 1.1058823529411765) internal successors, (94), 85 states have internal predecessors, (94), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 19:13:25,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 174 transitions. [2025-03-03 19:13:25,235 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 174 transitions. Word has length 131 [2025-03-03 19:13:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:25,235 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 174 transitions. [2025-03-03 19:13:25,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:25,236 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 174 transitions. [2025-03-03 19:13:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:25,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:25,237 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:25,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 19:13:25,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:25,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:25,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1927882613, now seen corresponding path program 1 times [2025-03-03 19:13:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:13:25,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905867864] [2025-03-03 19:13:25,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:25,445 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:25,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:13:25,447 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:13:25,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 19:13:25,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:25,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:25,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:25,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:25,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 19:13:25,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:26,346 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 387 proven. 33 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-03 19:13:26,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:13:26,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:13:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905867864] [2025-03-03 19:13:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905867864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:13:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1462657744] [2025-03-03 19:13:26,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:26,466 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-03 19:13:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-03 19:13:26,470 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-03 19:13:26,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-03-03 19:13:26,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:26,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:26,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:26,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:26,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-03 19:13:26,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 438 proven. 57 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-03-03 19:13:27,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 19:13:28,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1462657744] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:13:28,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 19:13:28,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2025-03-03 19:13:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071008024] [2025-03-03 19:13:28,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 19:13:28,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 19:13:28,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:13:28,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 19:13:28,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-03-03 19:13:28,088 INFO L87 Difference]: Start difference. First operand 132 states and 174 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2025-03-03 19:13:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:31,050 INFO L93 Difference]: Finished difference Result 366 states and 465 transitions. [2025-03-03 19:13:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-03 19:13:31,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) Word has length 131 [2025-03-03 19:13:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:31,056 INFO L225 Difference]: With dead ends: 366 [2025-03-03 19:13:31,056 INFO L226 Difference]: Without dead ends: 237 [2025-03-03 19:13:31,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 19:13:31,059 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 242 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:31,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 349 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 19:13:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-03 19:13:31,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 217. [2025-03-03 19:13:31,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 141 states have (on average 1.0851063829787233) internal successors, (153), 141 states have internal predecessors, (153), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 19:13:31,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 273 transitions. [2025-03-03 19:13:31,095 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 273 transitions. Word has length 131 [2025-03-03 19:13:31,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:31,095 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 273 transitions. [2025-03-03 19:13:31,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 16 states have internal predecessors, (75), 5 states have call successors, (40), 5 states have call predecessors, (40), 8 states have return successors, (40), 5 states have call predecessors, (40), 5 states have call successors, (40) [2025-03-03 19:13:31,095 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 273 transitions. [2025-03-03 19:13:31,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 19:13:31,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:31,097 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:31,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 19:13:31,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-03-03 19:13:31,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-03 19:13:31,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:31,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1634479606, now seen corresponding path program 1 times [2025-03-03 19:13:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:13:31,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [332112047] [2025-03-03 19:13:31,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:31,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:31,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:13:31,501 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:13:31,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-03 19:13:31,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 19:13:31,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 19:13:31,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:31,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:31,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 19:13:31,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:13:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 19:13:32,064 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:13:32,064 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:13:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [332112047] [2025-03-03 19:13:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [332112047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:13:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:13:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:13:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800349213] [2025-03-03 19:13:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:13:32,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:13:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:13:32,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:13:32,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:13:32,065 INFO L87 Difference]: Start difference. First operand 217 states and 273 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:32,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:13:32,769 INFO L93 Difference]: Finished difference Result 360 states and 450 transitions. [2025-03-03 19:13:32,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:13:32,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2025-03-03 19:13:32,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:13:32,782 INFO L225 Difference]: With dead ends: 360 [2025-03-03 19:13:32,782 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 19:13:32,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:13:32,783 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 38 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 19:13:32,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 243 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 19:13:32,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 19:13:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 130. [2025-03-03 19:13:32,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 79 states have (on average 1.0379746835443038) internal successors, (82), 79 states have internal predecessors, (82), 40 states have call successors, (40), 10 states have call predecessors, (40), 10 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 19:13:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2025-03-03 19:13:32,818 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 131 [2025-03-03 19:13:32,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:13:32,819 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2025-03-03 19:13:32,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 19:13:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2025-03-03 19:13:32,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 19:13:32,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:13:32,820 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 19:13:32,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-03 19:13:33,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:33,021 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:13:33,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:13:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash -758177645, now seen corresponding path program 1 times [2025-03-03 19:13:33,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:13:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956907022] [2025-03-03 19:13:33,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:13:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 19:13:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:13:33,023 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 19:13:33,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-03 19:13:33,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 19:13:33,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 19:13:33,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:13:33,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:13:33,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 19:13:33,174 INFO L279 TraceCheckSpWp]: Computing forward predicates...