./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_codestructure_dependencies_file-65.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 ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:51:32,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:51:32,281 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 09:51:32,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:51:32,284 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:51:32,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:51:32,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:51:32,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:51:32,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:51:32,300 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:51:32,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:51:32,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:51:32,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:51:32,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:51:32,301 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:51:32,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:51:32,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:51:32,301 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:51:32,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:51:32,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:51:32,303 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:51:32,303 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:51:32,303 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:51:32,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:51:32,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:51:32,305 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:51:32,305 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:51:32,305 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 -> ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 [2025-03-08 09:51:32,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:51:32,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:51:32,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:51:32,536 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:51:32,537 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:51:32,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2025-03-08 09:51:33,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b467a166/92fe07016fc9412cabbe9896861373b5/FLAG86259085e [2025-03-08 09:51:33,901 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:51:33,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2025-03-08 09:51:33,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b467a166/92fe07016fc9412cabbe9896861373b5/FLAG86259085e [2025-03-08 09:51:34,224 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b467a166/92fe07016fc9412cabbe9896861373b5 [2025-03-08 09:51:34,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:51:34,227 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:51:34,228 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:51:34,228 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:51:34,231 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:51:34,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fd295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34, skipping insertion in model container [2025-03-08 09:51:34,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:51:34,355 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_codestructure_dependencies_file-65.i[919,932] [2025-03-08 09:51:34,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:51:34,417 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:51:34,426 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_codestructure_dependencies_file-65.i[919,932] [2025-03-08 09:51:34,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:51:34,476 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:51:34,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34 WrapperNode [2025-03-08 09:51:34,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:51:34,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:51:34,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:51:34,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:51:34,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,516 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-03-08 09:51:34,518 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:51:34,519 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:51:34,519 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:51:34,519 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:51:34,525 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,528 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,548 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-08 09:51:34,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,548 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,553 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,554 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,555 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,557 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:51:34,558 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:51:34,558 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:51:34,558 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:51:34,558 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (1/1) ... [2025-03-08 09:51:34,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:51:34,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:51:34,590 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-08 09:51:34,593 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-08 09:51:34,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:51:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:51:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:51:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 09:51:34,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:51:34,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:51:34,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:51:34,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:51:34,919 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L123: havoc property_#t~bitwise16#1;havoc property_#t~short17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2025-03-08 09:51:34,936 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-08 09:51:34,936 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:51:34,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:51:34,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:51:34,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:34 BoogieIcfgContainer [2025-03-08 09:51:34,964 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:51:34,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:51:34,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:51:34,970 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:51:34,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:51:34" (1/3) ... [2025-03-08 09:51:34,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ffb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:51:34, skipping insertion in model container [2025-03-08 09:51:34,971 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:34" (2/3) ... [2025-03-08 09:51:34,971 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c8ffb06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:51:34, skipping insertion in model container [2025-03-08 09:51:34,972 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:34" (3/3) ... [2025-03-08 09:51:34,972 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-65.i [2025-03-08 09:51:34,983 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:51:34,986 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-65.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:51:35,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:51:35,041 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;@47cfbc49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:51:35,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:51:35,045 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 09:51:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 09:51:35,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:35,053 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:35,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:35,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1714205262, now seen corresponding path program 1 times [2025-03-08 09:51:35,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:51:35,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867841431] [2025-03-08 09:51:35,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:35,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:51:35,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 09:51:35,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 09:51:35,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:35,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 09:51:35,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:51:35,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867841431] [2025-03-08 09:51:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867841431] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:51:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632866900] [2025-03-08 09:51:35,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:35,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:51:35,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:51:35,266 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-08 09:51:35,267 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-08 09:51:35,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 09:51:35,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 09:51:35,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:35,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:35,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:51:35,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:51:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-03-08 09:51:35,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:51:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632866900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:51:35,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 09:51:35,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 09:51:35,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291658352] [2025-03-08 09:51:35,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:51:35,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:51:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:51:35,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:51:35,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:51:35,445 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 09:51:35,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:35,468 INFO L93 Difference]: Finished difference Result 142 states and 237 transitions. [2025-03-08 09:51:35,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:51:35,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2025-03-08 09:51:35,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:35,475 INFO L225 Difference]: With dead ends: 142 [2025-03-08 09:51:35,475 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 09:51:35,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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-08 09:51:35,481 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:35,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:51:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 09:51:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-08 09:51:35,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 09:51:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 100 transitions. [2025-03-08 09:51:35,517 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 100 transitions. Word has length 122 [2025-03-08 09:51:35,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:35,517 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 100 transitions. [2025-03-08 09:51:35,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 09:51:35,518 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 100 transitions. [2025-03-08 09:51:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 09:51:35,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:35,522 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:35,530 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-08 09:51:35,728 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-08 09:51:35,728 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:35,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:35,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1453153356, now seen corresponding path program 1 times [2025-03-08 09:51:35,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:51:35,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576611850] [2025-03-08 09:51:35,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:35,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:51:35,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 09:51:35,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 09:51:35,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:35,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 09:51:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:51:35,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576611850] [2025-03-08 09:51:35,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576611850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:51:35,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:51:35,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 09:51:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650693865] [2025-03-08 09:51:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:51:35,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 09:51:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:51:35,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 09:51:35,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:51:35,953 INFO L87 Difference]: Start difference. First operand 69 states and 100 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 09:51:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:36,005 INFO L93 Difference]: Finished difference Result 174 states and 256 transitions. [2025-03-08 09:51:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 09:51:36,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 122 [2025-03-08 09:51:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:36,008 INFO L225 Difference]: With dead ends: 174 [2025-03-08 09:51:36,009 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 09:51:36,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 09:51:36,011 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 89 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:36,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 199 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:51:36,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 09:51:36,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2025-03-08 09:51:36,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 09:51:36,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2025-03-08 09:51:36,023 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 122 [2025-03-08 09:51:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:36,024 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2025-03-08 09:51:36,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 09:51:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2025-03-08 09:51:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 09:51:36,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:36,026 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:36,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 09:51:36,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:36,029 INFO L85 PathProgramCache]: Analyzing trace with hash -433359889, now seen corresponding path program 1 times [2025-03-08 09:51:36,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:51:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641149234] [2025-03-08 09:51:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:36,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:51:36,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 09:51:36,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 09:51:36,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:36,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 09:51:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:51:36,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641149234] [2025-03-08 09:51:36,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641149234] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:51:36,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:51:36,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:51:36,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730869706] [2025-03-08 09:51:36,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:51:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:51:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:51:36,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:51:36,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:51:36,932 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 09:51:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:37,249 INFO L93 Difference]: Finished difference Result 174 states and 248 transitions. [2025-03-08 09:51:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 09:51:37,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2025-03-08 09:51:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:37,251 INFO L225 Difference]: With dead ends: 174 [2025-03-08 09:51:37,251 INFO L226 Difference]: Without dead ends: 108 [2025-03-08 09:51:37,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:51:37,252 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 154 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:37,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 338 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:51:37,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-08 09:51:37,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 69. [2025-03-08 09:51:37,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 09:51:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 95 transitions. [2025-03-08 09:51:37,261 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 95 transitions. Word has length 124 [2025-03-08 09:51:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:37,262 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 95 transitions. [2025-03-08 09:51:37,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 09:51:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 95 transitions. [2025-03-08 09:51:37,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 09:51:37,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:37,264 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:37,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 09:51:37,264 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:37,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 533949834, now seen corresponding path program 1 times [2025-03-08 09:51:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:51:37,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311579565] [2025-03-08 09:51:37,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:51:37,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:51:37,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:51:37,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:37,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 09:51:37,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:51:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311579565] [2025-03-08 09:51:37,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311579565] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 09:51:37,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865823495] [2025-03-08 09:51:37,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:37,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 09:51:37,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:51:37,611 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-08 09:51:37,613 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-08 09:51:37,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 09:51:37,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 09:51:37,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:37,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:37,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 09:51:37,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:51:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-08 09:51:37,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:51:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 09:51:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865823495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:51:38,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 09:51:38,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-08 09:51:38,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592569600] [2025-03-08 09:51:38,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 09:51:38,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 09:51:38,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:51:38,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 09:51:38,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-08 09:51:38,088 INFO L87 Difference]: Start difference. First operand 69 states and 95 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 09:51:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:38,349 INFO L93 Difference]: Finished difference Result 158 states and 214 transitions. [2025-03-08 09:51:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 09:51:38,349 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 128 [2025-03-08 09:51:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:38,350 INFO L225 Difference]: With dead ends: 158 [2025-03-08 09:51:38,350 INFO L226 Difference]: Without dead ends: 92 [2025-03-08 09:51:38,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2025-03-08 09:51:38,351 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 162 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:38,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 195 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:51:38,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-08 09:51:38,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2025-03-08 09:51:38,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.152542372881356) internal successors, (68), 60 states have internal predecessors, (68), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 09:51:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2025-03-08 09:51:38,361 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 128 [2025-03-08 09:51:38,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:38,361 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2025-03-08 09:51:38,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 09:51:38,362 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2025-03-08 09:51:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 09:51:38,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:38,363 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:38,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 09:51:38,563 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,SelfDestructingSolverStorable3 [2025-03-08 09:51:38,563 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:38,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:38,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1067548164, now seen corresponding path program 1 times [2025-03-08 09:51:38,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:51:38,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957222318] [2025-03-08 09:51:38,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:38,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:51:38,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 09:51:38,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 09:51:38,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:38,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:39,140 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-03-08 09:51:39,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 09:51:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957222318] [2025-03-08 09:51:39,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957222318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:51:39,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:51:39,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 09:51:39,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80165376] [2025-03-08 09:51:39,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:51:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 09:51:39,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 09:51:39,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 09:51:39,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 09:51:39,146 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 09:51:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:39,446 INFO L93 Difference]: Finished difference Result 180 states and 236 transitions. [2025-03-08 09:51:39,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 09:51:39,447 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 129 [2025-03-08 09:51:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:39,449 INFO L225 Difference]: With dead ends: 180 [2025-03-08 09:51:39,451 INFO L226 Difference]: Without dead ends: 110 [2025-03-08 09:51:39,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 09:51:39,452 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 193 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:39,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 174 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 09:51:39,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-08 09:51:39,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-03-08 09:51:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.1111111111111112) internal successors, (80), 73 states have internal predecessors, (80), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-08 09:51:39,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 140 transitions. [2025-03-08 09:51:39,474 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 140 transitions. Word has length 129 [2025-03-08 09:51:39,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:39,474 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 140 transitions. [2025-03-08 09:51:39,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-08 09:51:39,474 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2025-03-08 09:51:39,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 09:51:39,476 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:39,476 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:39,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 09:51:39,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 774145157, now seen corresponding path program 1 times [2025-03-08 09:51:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 09:51:39,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113775166] [2025-03-08 09:51:39,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:39,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 09:51:39,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 09:51:39,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 09:51:39,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:39,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:51:39,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 09:51:39,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 09:51:39,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 09:51:39,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:39,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 09:51:39,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 09:51:39,594 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 09:51:39,594 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 09:51:39,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 09:51:39,601 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 09:51:39,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 09:51:39,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:51:39 BoogieIcfgContainer [2025-03-08 09:51:39,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 09:51:39,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 09:51:39,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 09:51:39,683 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 09:51:39,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:34" (3/4) ... [2025-03-08 09:51:39,685 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 09:51:39,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 09:51:39,686 INFO L158 Benchmark]: Toolchain (without parser) took 5459.59ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 129.7MB in the beginning and 114.3MB in the end (delta: 15.4MB). Peak memory consumption was 58.5MB. Max. memory is 16.1GB. [2025-03-08 09:51:39,686 INFO L158 Benchmark]: CDTParser took 0.75ms. Allocated memory is still 192.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:51:39,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.54ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 115.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 09:51:39,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.61ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 112.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:51:39,687 INFO L158 Benchmark]: Boogie Preprocessor took 38.38ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 109.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:51:39,687 INFO L158 Benchmark]: IcfgBuilder took 406.09ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 86.4MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 09:51:39,688 INFO L158 Benchmark]: TraceAbstraction took 4716.89ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 86.0MB in the beginning and 114.3MB in the end (delta: -28.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2025-03-08 09:51:39,688 INFO L158 Benchmark]: Witness Printer took 3.39ms. Allocated memory is still 209.7MB. Free memory was 114.3MB in the beginning and 114.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 09:51:39,689 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.75ms. Allocated memory is still 192.9MB. Free memory is still 119.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.54ms. Allocated memory is still 167.8MB. Free memory was 129.3MB in the beginning and 115.6MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.61ms. Allocated memory is still 167.8MB. Free memory was 115.6MB in the beginning and 112.9MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.38ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 109.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 406.09ms. Allocated memory is still 167.8MB. Free memory was 109.5MB in the beginning and 86.4MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4716.89ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 86.0MB in the beginning and 114.3MB in the end (delta: -28.3MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Witness Printer took 3.39ms. Allocated memory is still 209.7MB. Free memory was 114.3MB in the beginning and 114.3MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 103. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_8 = 64; [L24] unsigned short int var_1_11 = 256; [L25] unsigned short int var_1_12 = 0; [L26] unsigned short int var_1_13 = 64; [L27] unsigned char var_1_14 = 1; [L28] unsigned char var_1_15 = 0; [L29] signed char var_1_16 = 50; [L30] signed char var_1_19 = -100; [L31] double var_1_20 = 100000000.8; [L32] double var_1_21 = 15.125; [L33] double var_1_22 = 99.22; [L34] signed long int var_1_23 = -16; [L35] unsigned char var_1_24 = 1; [L36] signed char var_1_25 = 10; [L37] signed char var_1_26 = 16; [L38] unsigned char var_1_27 = 0; [L39] double var_1_28 = 5.5; [L40] signed short int last_1_var_1_1 = 4; [L41] unsigned char last_1_var_1_14 = 1; [L42] signed char last_1_var_1_16 = 50; [L43] signed long int last_1_var_1_23 = -16; [L44] unsigned char last_1_var_1_24 = 1; [L45] double last_1_var_1_28 = 5.5; VAL [isInitial=0, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L115] last_1_var_1_1 = var_1_1 [L116] last_1_var_1_14 = var_1_14 [L117] last_1_var_1_16 = var_1_16 [L118] last_1_var_1_23 = var_1_23 [L119] last_1_var_1_24 = var_1_24 [L120] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_11 = __VERIFIER_nondet_ushort() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L87] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L87] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L88] var_1_12 = __VERIFIER_nondet_ushort() [L89] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L89] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L90] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L91] var_1_13 = __VERIFIER_nondet_ushort() [L92] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L92] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L93] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=0, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L95] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L96] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L97] var_1_19 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L98] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L99] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L100] var_1_21 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L101] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L102] var_1_22 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L103] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L104] var_1_25 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L105] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L106] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_8=64] [L107] var_1_26 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L108] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L109] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L110] var_1_27 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_8=64] [L111] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_28=11/2, var_1_8=64] [L112] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L112] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L131] RET updateVariables() [L132] CALL step() [L49] EXPR ((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L49] COND TRUE (((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23 [L50] var_1_23 = (5 - var_1_12) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L54] COND FALSE !(last_1_var_1_23 < last_1_var_1_23) [L65] var_1_16 = 100 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_20=500000004/5, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_8=64] [L67] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) [L68] var_1_28 = var_1_21 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=4, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L69] COND TRUE (var_1_23 <= var_1_23) || (var_1_23 > 4) [L70] var_1_1 = (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=1, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L74] var_1_24 = ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L75] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L75] COND TRUE var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16)) [L76] var_1_14 = (var_1_24 || var_1_15) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L78] COND TRUE \read(var_1_14) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L79] COND FALSE !(\read(var_1_24)) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123] EXPR var_1_16 ^ var_1_16 VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123] EXPR ((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123] EXPR (((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1)))))) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L123-L124] return (((((((((var_1_23 <= var_1_23) || (var_1_23 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_16 + (var_1_16 + var_1_16))) > (-100)) ? ((var_1_16 + (var_1_16 + var_1_16))) : (-100))))) : (var_1_1 == ((signed short int) var_1_16))) && (var_1_14 ? (var_1_24 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_16 > (var_1_23 + (var_1_16 ^ var_1_16))) ? (var_1_14 == ((unsigned char) (var_1_24 || var_1_15))) : 1)) && ((last_1_var_1_23 < last_1_var_1_23) ? (((! (last_1_var_1_14 || last_1_var_1_14)) && last_1_var_1_24) ? ((((((2.75f) > (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f))))) ? (2.75f) : (((((last_1_var_1_28) < (999999.95f)) ? (last_1_var_1_28) : (999999.95f)))))) != last_1_var_1_28) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((last_1_var_1_1) > (last_1_var_1_16)) ? (last_1_var_1_1) : (last_1_var_1_16))) | last_1_var_1_16) >= last_1_var_1_23) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (last_1_var_1_1)) ? (var_1_11) : (last_1_var_1_1))))))) && (var_1_24 == ((unsigned char) ((var_1_1 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, last_1_var_1_16=50, last_1_var_1_1=4, last_1_var_1_23=-16, last_1_var_1_24=1, last_1_var_1_28=11/2, var_1_11=32767, var_1_12=32767, var_1_13=65533, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=-127, var_1_1=300, var_1_21=100000005, var_1_23=-32762, var_1_24=0, var_1_25=127, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_8=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 133 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 6, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 605 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 1004 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 441 mSDsCounter, 255 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 459 IncrementalHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 255 mSolverCounterUnsat, 563 mSDtfsCounter, 459 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 84 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1004 NumberOfCodeBlocks, 1004 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 995 ConstructedInterpolants, 0 QuantifiedInterpolants, 2356 SizeOfPredicates, 2 NumberOfNonLiveVariables, 609 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 4763/4896 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-08 09:51:39,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_codestructure_dependencies_file-65.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 ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 09:51:41,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 09:51:41,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 09:51:41,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 09:51:41,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 09:51:41,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 09:51:41,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 09:51:41,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 09:51:41,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 09:51:41,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 09:51:41,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 09:51:41,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 09:51:41,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 09:51:41,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 09:51:41,808 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 09:51:41,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 09:51:41,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 09:51:41,810 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 09:51:41,810 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:51:41,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 09:51:41,811 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 09:51:41,811 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 -> ac823ca5cc50fe08113211c1a95dfd9bb1053bd3689b9e5db62b1cf9eb37d385 [2025-03-08 09:51:42,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 09:51:42,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 09:51:42,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 09:51:42,063 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 09:51:42,063 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 09:51:42,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2025-03-08 09:51:43,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35150cee6/6414f7d487ac4321967f77db0e98e031/FLAGdf599e370 [2025-03-08 09:51:43,450 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 09:51:43,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-65.i [2025-03-08 09:51:43,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35150cee6/6414f7d487ac4321967f77db0e98e031/FLAGdf599e370 [2025-03-08 09:51:43,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35150cee6/6414f7d487ac4321967f77db0e98e031 [2025-03-08 09:51:43,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 09:51:43,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 09:51:43,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 09:51:43,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 09:51:43,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 09:51:43,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637edb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43, skipping insertion in model container [2025-03-08 09:51:43,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 09:51:43,584 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_codestructure_dependencies_file-65.i[919,932] [2025-03-08 09:51:43,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:51:43,646 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 09:51:43,656 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_codestructure_dependencies_file-65.i[919,932] [2025-03-08 09:51:43,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 09:51:43,711 INFO L204 MainTranslator]: Completed translation [2025-03-08 09:51:43,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43 WrapperNode [2025-03-08 09:51:43,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 09:51:43,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 09:51:43,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 09:51:43,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 09:51:43,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,730 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,750 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2025-03-08 09:51:43,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 09:51:43,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 09:51:43,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 09:51:43,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 09:51:43,760 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,762 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,780 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-08 09:51:43,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,792 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 09:51:43,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 09:51:43,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 09:51:43,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 09:51:43,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (1/1) ... [2025-03-08 09:51:43,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 09:51:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 09:51:43,832 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-08 09:51:43,837 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-08 09:51:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 09:51:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 09:51:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 09:51:43,850 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 09:51:43,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 09:51:43,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 09:51:43,910 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 09:51:43,912 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 09:51:45,538 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-08 09:51:45,538 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 09:51:45,547 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 09:51:45,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 09:51:45,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:45 BoogieIcfgContainer [2025-03-08 09:51:45,548 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 09:51:45,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 09:51:45,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 09:51:45,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 09:51:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:51:43" (1/3) ... [2025-03-08 09:51:45,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68943518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:51:45, skipping insertion in model container [2025-03-08 09:51:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:51:43" (2/3) ... [2025-03-08 09:51:45,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68943518 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:51:45, skipping insertion in model container [2025-03-08 09:51:45,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:51:45" (3/3) ... [2025-03-08 09:51:45,555 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-65.i [2025-03-08 09:51:45,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 09:51:45,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-65.i that has 2 procedures, 56 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 09:51:45,631 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 09:51:45,642 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;@370e0f30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 09:51:45,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 09:51:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 09:51:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 09:51:45,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:45,656 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:45,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:45,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash 611677147, now seen corresponding path program 1 times [2025-03-08 09:51:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:51:45,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636446319] [2025-03-08 09:51:45,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:45,669 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-08 09:51:45,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:51:45,671 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-08 09:51:45,674 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-08 09:51:45,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 09:51:45,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 09:51:45,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:45,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:45,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 09:51:45,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:51:45,971 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-03-08 09:51:45,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:51:45,972 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:51:45,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636446319] [2025-03-08 09:51:45,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636446319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:51:45,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:51:45,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 09:51:45,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775491086] [2025-03-08 09:51:45,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:51:45,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 09:51:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:51:45,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 09:51:45,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 09:51:45,994 INFO L87 Difference]: Start difference. First operand has 56 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 36 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 09:51:46,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:46,010 INFO L93 Difference]: Finished difference Result 104 states and 175 transitions. [2025-03-08 09:51:46,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 09:51:46,012 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2025-03-08 09:51:46,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:46,017 INFO L225 Difference]: With dead ends: 104 [2025-03-08 09:51:46,017 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 09:51:46,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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-08 09:51:46,022 INFO L435 NwaCegarLoop]: 72 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, 72 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-08 09:51:46,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 09:51:46,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 09:51:46,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-08 09:51:46,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-08 09:51:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2025-03-08 09:51:46,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 116 [2025-03-08 09:51:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:46,055 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2025-03-08 09:51:46,055 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, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-08 09:51:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2025-03-08 09:51:46,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 09:51:46,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:46,058 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:46,067 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-08 09:51:46,258 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-08 09:51:46,259 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:46,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:46,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1187711911, now seen corresponding path program 1 times [2025-03-08 09:51:46,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:51:46,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435523428] [2025-03-08 09:51:46,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:46,261 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-08 09:51:46,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:51:46,263 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-08 09:51:46,264 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-08 09:51:46,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 09:51:46,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 09:51:46,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:46,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:46,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 09:51:46,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:51:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-08 09:51:46,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 09:51:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 09:51:47,051 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:51:47,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435523428] [2025-03-08 09:51:47,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435523428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 09:51:47,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 09:51:47,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-08 09:51:47,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526054782] [2025-03-08 09:51:47,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 09:51:47,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 09:51:47,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:51:47,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 09:51:47,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-08 09:51:47,054 INFO L87 Difference]: Start difference. First operand 51 states and 72 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 09:51:48,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 09:51:48,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:48,643 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2025-03-08 09:51:48,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 09:51:48,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 116 [2025-03-08 09:51:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:48,650 INFO L225 Difference]: With dead ends: 118 [2025-03-08 09:51:48,651 INFO L226 Difference]: Without dead ends: 70 [2025-03-08 09:51:48,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-08 09:51:48,652 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 111 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:48,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 118 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 09:51:48,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-08 09:51:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2025-03-08 09:51:48,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 38 states have (on average 1.105263157894737) internal successors, (42), 39 states have internal predecessors, (42), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-08 09:51:48,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2025-03-08 09:51:48,665 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 116 [2025-03-08 09:51:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:48,665 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2025-03-08 09:51:48,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-08 09:51:48,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2025-03-08 09:51:48,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 09:51:48,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:48,668 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:48,677 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-08 09:51:48,868 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-08 09:51:48,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:48,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1807992334, now seen corresponding path program 1 times [2025-03-08 09:51:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:51:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306305998] [2025-03-08 09:51:48,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:48,870 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-08 09:51:48,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:51:48,872 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-08 09:51:48,874 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-08 09:51:48,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 09:51:49,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 09:51:49,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:49,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:49,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 09:51:49,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:51:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-08 09:51:49,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 09:51:49,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 09:51:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306305998] [2025-03-08 09:51:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306305998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 09:51:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 09:51:49,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 09:51:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122356246] [2025-03-08 09:51:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 09:51:49,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 09:51:49,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 09:51:49,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 09:51:49,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 09:51:49,190 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 09:51:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 09:51:50,380 INFO L93 Difference]: Finished difference Result 168 states and 221 transitions. [2025-03-08 09:51:50,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 09:51:50,381 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2025-03-08 09:51:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 09:51:50,382 INFO L225 Difference]: With dead ends: 168 [2025-03-08 09:51:50,382 INFO L226 Difference]: Without dead ends: 116 [2025-03-08 09:51:50,383 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2025-03-08 09:51:50,383 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 84 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 09:51:50,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 208 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 09:51:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-08 09:51:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 93. [2025-03-08 09:51:50,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-08 09:51:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2025-03-08 09:51:50,404 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 117 [2025-03-08 09:51:50,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 09:51:50,404 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2025-03-08 09:51:50,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2025-03-08 09:51:50,404 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2025-03-08 09:51:50,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-08 09:51:50,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 09:51:50,405 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 09:51:50,415 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 (4)] Forceful destruction successful, exit code 0 [2025-03-08 09:51:50,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 09:51:50,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 09:51:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 09:51:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1808915855, now seen corresponding path program 1 times [2025-03-08 09:51:50,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 09:51:50,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364404627] [2025-03-08 09:51:50,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 09:51:50,607 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-08 09:51:50,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 09:51:50,609 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 09:51:50,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 09:51:50,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-08 09:51:50,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-08 09:51:50,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 09:51:50,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 09:51:50,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 09:51:50,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 09:52:29,611 WARN L286 SmtUtils]: Spent 17.16s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-08 09:53:06,718 WARN L286 SmtUtils]: Spent 12.33s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)