./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.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_operatoramount_amount25_file-72.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 c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:25:52,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:25:52,126 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 00:25:52,130 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:25:52,132 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:25:52,151 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:25:52,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:25:52,152 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:25:52,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:25:52,152 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:25:52,152 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:25:52,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:25:52,152 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:25:52,152 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:25:52,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:25:52,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:25:52,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:25:52,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:52,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:25:52,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:25:52,155 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 -> c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 [2025-03-04 00:25:52,384 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:25:52,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:25:52,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:25:52,395 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:25:52,395 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:25:52,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2025-03-04 00:25:53,516 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1852d25b/0a23cbafac114b45b5a1476f2475e25b/FLAG560b2b4fb [2025-03-04 00:25:53,763 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:25:53,763 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2025-03-04 00:25:53,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1852d25b/0a23cbafac114b45b5a1476f2475e25b/FLAG560b2b4fb [2025-03-04 00:25:53,780 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1852d25b/0a23cbafac114b45b5a1476f2475e25b [2025-03-04 00:25:53,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:25:53,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:25:53,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:25:53,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:25:53,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:25:53,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:53,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65318d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53, skipping insertion in model container [2025-03-04 00:25:53,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:53,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:25:53,902 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_operatoramount_amount25_file-72.i[915,928] [2025-03-04 00:25:53,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:25:53,954 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:25:53,966 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_operatoramount_amount25_file-72.i[915,928] [2025-03-04 00:25:53,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:25:53,994 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:25:53,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53 WrapperNode [2025-03-04 00:25:53,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:25:53,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:25:53,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:25:53,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:25:54,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,036 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-04 00:25:54,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:25:54,036 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:25:54,036 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:25:54,037 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:25:54,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,065 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-04 00:25:54,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,076 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:25:54,088 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:25:54,088 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:25:54,088 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:25:54,089 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (1/1) ... [2025-03-04 00:25:54,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:54,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:25:54,120 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-04 00:25:54,124 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-04 00:25:54,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:25:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:25:54,143 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:25:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 00:25:54,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:25:54,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:25:54,194 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:25:54,195 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:25:54,339 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:25:54,340 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:25:54,347 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:25:54,347 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:25:54,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:54 BoogieIcfgContainer [2025-03-04 00:25:54,350 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:25:54,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:25:54,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:25:54,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:25:54,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:25:53" (1/3) ... [2025-03-04 00:25:54,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ac8a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:25:54, skipping insertion in model container [2025-03-04 00:25:54,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:25:53" (2/3) ... [2025-03-04 00:25:54,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67ac8a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:25:54, skipping insertion in model container [2025-03-04 00:25:54,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:54" (3/3) ... [2025-03-04 00:25:54,356 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-72.i [2025-03-04 00:25:54,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:25:54,368 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-72.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:25:54,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:25:54,425 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;@2e1c2d59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:25:54,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:25:54,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:25:54,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 00:25:54,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:54,437 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:25:54,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:54,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1040749203, now seen corresponding path program 1 times [2025-03-04 00:25:54,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710531324] [2025-03-04 00:25:54,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:54,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:54,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:25:54,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:25:54,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:54,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:25:54,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:54,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710531324] [2025-03-04 00:25:54,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710531324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:25:54,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131837018] [2025-03-04 00:25:54,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:54,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:25:54,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:25:54,684 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-04 00:25:54,685 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-04 00:25:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:25:54,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:25:54,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:54,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:54,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:25:54,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:25:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-04 00:25:54,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:25:54,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131837018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:25:54,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 00:25:54,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 00:25:54,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564778145] [2025-03-04 00:25:54,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:25:54,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:25:54,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:54,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:25:54,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:25:54,898 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:25:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:54,920 INFO L93 Difference]: Finished difference Result 116 states and 196 transitions. [2025-03-04 00:25:54,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:25:54,922 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-04 00:25:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:54,926 INFO L225 Difference]: With dead ends: 116 [2025-03-04 00:25:54,926 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:25:54,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:25:54,932 INFO L435 NwaCegarLoop]: 84 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, 84 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-04 00:25:54,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:25:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:25:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 00:25:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:25:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-03-04 00:25:54,959 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2025-03-04 00:25:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:54,959 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-03-04 00:25:54,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:25:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-03-04 00:25:54,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 00:25:54,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:54,961 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:25:54,967 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-04 00:25:55,162 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-04 00:25:55,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:55,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash 979548870, now seen corresponding path program 1 times [2025-03-04 00:25:55,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:55,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732203283] [2025-03-04 00:25:55,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:55,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:55,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:25:55,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:25:55,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:55,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:25:55,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 00:25:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732203283] [2025-03-04 00:25:55,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732203283] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 00:25:55,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383859338] [2025-03-04 00:25:55,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:55,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 00:25:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:25:55,525 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-04 00:25:55,527 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-04 00:25:55,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:25:55,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:25:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:25:55,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 00:25:55,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:25:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-04 00:25:55,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:25:56,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:25:56,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383859338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:25:56,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 00:25:56,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 00:25:56,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661165938] [2025-03-04 00:25:56,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 00:25:56,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:25:56,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 00:25:56,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:25:56,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:25:56,028 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:25:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:25:56,198 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2025-03-04 00:25:56,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:25:56,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2025-03-04 00:25:56,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:25:56,201 INFO L225 Difference]: With dead ends: 121 [2025-03-04 00:25:56,201 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 00:25:56,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:25:56,202 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 00:25:56,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 121 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 00:25:56,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 00:25:56,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-04 00:25:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:25:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-04 00:25:56,219 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2025-03-04 00:25:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:25:56,219 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-04 00:25:56,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:25:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-04 00:25:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 00:25:56,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:25:56,221 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:25:56,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 00:25:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-04 00:25:56,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:25:56,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:25:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1572608091, now seen corresponding path program 1 times [2025-03-04 00:25:56,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 00:25:56,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261285719] [2025-03-04 00:25:56,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:25:56,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 00:25:56,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:25:56,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:25:56,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:56,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:25:56,491 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 00:25:56,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:25:56,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:25:56,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:25:56,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 00:25:56,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 00:25:56,595 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 00:25:56,596 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 00:25:56,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 00:25:56,602 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-04 00:25:56,665 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 00:25:56,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 12:25:56 BoogieIcfgContainer [2025-03-04 00:25:56,667 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 00:25:56,668 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 00:25:56,668 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 00:25:56,668 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 00:25:56,668 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:25:54" (3/4) ... [2025-03-04 00:25:56,670 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 00:25:56,670 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 00:25:56,671 INFO L158 Benchmark]: Toolchain (without parser) took 2887.91ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 90.5MB in the end (delta: 14.9MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2025-03-04 00:25:56,671 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:56,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.81ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:25:56,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.67ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:56,672 INFO L158 Benchmark]: Boogie Preprocessor took 50.92ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:56,672 INFO L158 Benchmark]: IcfgBuilder took 261.63ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 72.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 00:25:56,672 INFO L158 Benchmark]: TraceAbstraction took 2316.10ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 90.5MB in the end (delta: -18.1MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. [2025-03-04 00:25:56,672 INFO L158 Benchmark]: Witness Printer took 2.73ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 90.5MB in the end (delta: 37.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 00:25:56,673 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.56ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.81ms. Allocated memory is still 142.6MB. Free memory was 105.4MB in the beginning and 92.3MB in the end (delta: 13.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.67ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 91.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.92ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 89.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 261.63ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 72.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2316.10ms. Allocated memory is still 142.6MB. Free memory was 72.5MB in the beginning and 90.5MB in the end (delta: -18.1MB). Peak memory consumption was 35.4MB. Max. memory is 16.1GB. * Witness Printer took 2.73ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 90.5MB in the end (delta: 37.0kB). 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 someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 128.875; [L24] double var_1_3 = 24.5; [L25] double var_1_4 = 8.2; [L26] double var_1_5 = 10.05; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned long int var_1_10 = 2; [L32] signed char var_1_11 = -16; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = 4; [L36] double var_1_15 = 256.4; [L37] float var_1_16 = 0.25; [L38] double var_1_17 = 100000000000.2; [L39] double var_1_18 = 50.5; [L40] double var_1_19 = 9.5; VAL [isInitial=0, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_2=1031/8, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] var_1_4 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] var_1_5 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1] [L79] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_12 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] var_1_14 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_16 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L94] var_1_18 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L96] var_1_19 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L48] COND FALSE !((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L55] COND TRUE var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L56] var_1_1 = (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) ? ((var_1_3 >= var_1_4) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) var_1_17))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=63, var_1_13=63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 132 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 140 mSDtfsCounter, 132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 SizeOfPredicates, 1 NumberOfNonLiveVariables, 626 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4917/5060 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-04 00:25:56,691 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_operatoramount_amount25_file-72.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 c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 00:25:58,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 00:25:58,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 00:25:58,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 00:25:58,507 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 00:25:58,525 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 00:25:58,526 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 00:25:58,526 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 00:25:58,526 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 00:25:58,526 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 00:25:58,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 00:25:58,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 00:25:58,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 00:25:58,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 00:25:58,528 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 00:25:58,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 00:25:58,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 00:25:58,528 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 00:25:58,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 00:25:58,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 00:25:58,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 00:25:58,529 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:25:58,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 00:25:58,529 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 00:25:58,530 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 00:25:58,530 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 00:25:58,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 00:25:58,531 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 00:25:58,531 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 -> c8b001b3dcc7656ec6a872649086f64f7da81d9efec3124c392a390ea73a5389 [2025-03-04 00:25:58,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 00:25:58,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 00:25:58,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 00:25:58,783 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 00:25:58,783 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 00:25:58,784 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2025-03-04 00:25:59,929 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1f16f65/9e9791e3d67542f0b27d78cc87186be9/FLAGed8005943 [2025-03-04 00:26:00,125 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 00:26:00,126 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-72.i [2025-03-04 00:26:00,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1f16f65/9e9791e3d67542f0b27d78cc87186be9/FLAGed8005943 [2025-03-04 00:26:00,492 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf1f16f65/9e9791e3d67542f0b27d78cc87186be9 [2025-03-04 00:26:00,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 00:26:00,495 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 00:26:00,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:00,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 00:26:00,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 00:26:00,499 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00, skipping insertion in model container [2025-03-04 00:26:00,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 00:26:00,610 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_operatoramount_amount25_file-72.i[915,928] [2025-03-04 00:26:00,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:00,651 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 00:26:00,659 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_operatoramount_amount25_file-72.i[915,928] [2025-03-04 00:26:00,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 00:26:00,686 INFO L204 MainTranslator]: Completed translation [2025-03-04 00:26:00,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00 WrapperNode [2025-03-04 00:26:00,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 00:26:00,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:00,687 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 00:26:00,687 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 00:26:00,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,725 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-03-04 00:26:00,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 00:26:00,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 00:26:00,730 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 00:26:00,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 00:26:00,736 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,749 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-04 00:26:00,753 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,764 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,777 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 00:26:00,777 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 00:26:00,777 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 00:26:00,778 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 00:26:00,778 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (1/1) ... [2025-03-04 00:26:00,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 00:26:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 00:26:00,804 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-04 00:26:00,806 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-04 00:26:00,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 00:26:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 00:26:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 00:26:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 00:26:00,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 00:26:00,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 00:26:00,870 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 00:26:00,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 00:26:15,503 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-04 00:26:15,503 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 00:26:15,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 00:26:15,511 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 00:26:15,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:15 BoogieIcfgContainer [2025-03-04 00:26:15,511 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 00:26:15,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 00:26:15,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 00:26:15,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 00:26:15,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 12:26:00" (1/3) ... [2025-03-04 00:26:15,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b599e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:15, skipping insertion in model container [2025-03-04 00:26:15,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 12:26:00" (2/3) ... [2025-03-04 00:26:15,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b599e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 12:26:15, skipping insertion in model container [2025-03-04 00:26:15,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 12:26:15" (3/3) ... [2025-03-04 00:26:15,520 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-72.i [2025-03-04 00:26:15,530 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 00:26:15,531 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount25_file-72.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 00:26:15,566 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 00:26:15,573 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;@74cad6ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 00:26:15,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 00:26:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:26:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 00:26:15,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:15,586 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:26:15,586 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1040749203, now seen corresponding path program 1 times [2025-03-04 00:26:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:15,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092146312] [2025-03-04 00:26:15,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:15,597 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-04 00:26:15,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:15,599 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-04 00:26:15,601 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-04 00:26:15,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:26:16,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:26:16,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:16,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:16,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 00:26:16,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-03-04 00:26:16,663 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 00:26:16,663 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:26:16,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092146312] [2025-03-04 00:26:16,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092146312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 00:26:16,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 00:26:16,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 00:26:16,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882666477] [2025-03-04 00:26:16,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 00:26:16,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 00:26:16,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:26:16,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 00:26:16,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 00:26:16,680 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:26:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:16,696 INFO L93 Difference]: Finished difference Result 116 states and 196 transitions. [2025-03-04 00:26:16,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 00:26:16,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-03-04 00:26:16,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:16,703 INFO L225 Difference]: With dead ends: 116 [2025-03-04 00:26:16,703 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 00:26:16,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-04 00:26:16,709 INFO L435 NwaCegarLoop]: 84 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, 84 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-04 00:26:16,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 00:26:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 00:26:16,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 00:26:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:26:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-03-04 00:26:16,745 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2025-03-04 00:26:16,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:16,746 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-03-04 00:26:16,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-04 00:26:16,746 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-03-04 00:26:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 00:26:16,748 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:16,748 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:26:16,776 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 (2)] Forceful destruction successful, exit code 0 [2025-03-04 00:26:16,948 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-04 00:26:16,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:16,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:16,950 INFO L85 PathProgramCache]: Analyzing trace with hash 979548870, now seen corresponding path program 1 times [2025-03-04 00:26:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414798344] [2025-03-04 00:26:16,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:16,950 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-04 00:26:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:16,953 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-04 00:26:16,953 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-04 00:26:16,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:26:17,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:26:17,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:17,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:17,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 00:26:17,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-03-04 00:26:19,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 00:26:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-04 00:26:22,444 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 00:26:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414798344] [2025-03-04 00:26:22,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414798344] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 00:26:22,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 00:26:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-04 00:26:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467545357] [2025-03-04 00:26:22,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 00:26:22,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 00:26:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 00:26:22,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 00:26:22,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-04 00:26:22,446 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:26:29,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:26:33,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:26:37,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 00:26:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 00:26:37,841 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2025-03-04 00:26:37,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 00:26:37,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2025-03-04 00:26:37,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 00:26:37,993 INFO L225 Difference]: With dead ends: 121 [2025-03-04 00:26:37,993 INFO L226 Difference]: Without dead ends: 66 [2025-03-04 00:26:37,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 00:26:37,994 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 85 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 49 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2025-03-04 00:26:37,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 119 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2025-03-04 00:26:37,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-04 00:26:38,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-03-04 00:26:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 00:26:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-03-04 00:26:38,004 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2025-03-04 00:26:38,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 00:26:38,005 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-03-04 00:26:38,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-03-04 00:26:38,006 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-03-04 00:26:38,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 00:26:38,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 00:26:38,007 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 00:26:38,037 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 (3)] Ended with exit code 0 [2025-03-04 00:26:38,208 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-04 00:26:38,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 00:26:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 00:26:38,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1572608091, now seen corresponding path program 1 times [2025-03-04 00:26:38,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 00:26:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213514822] [2025-03-04 00:26:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 00:26:38,209 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-04 00:26:38,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 00:26:38,213 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-04 00:26:38,214 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-04 00:26:38,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 00:26:39,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 00:26:39,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 00:26:39,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 00:26:39,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 00:26:39,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 00:26:55,134 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:27:03,469 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:27:11,677 WARN L286 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:27:20,012 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:27:28,344 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-04 00:27:36,687 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)