./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:39:19,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:39:19,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 18:39:19,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:39:19,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:39:19,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:39:19,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:39:19,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:39:19,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:39:19,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:39:19,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:39:19,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:39:19,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:39:19,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:39:19,575 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:39:19,575 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:39:19,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:39:19,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:39:19,576 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2025-03-03 18:39:19,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:39:19,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:39:19,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:39:19,811 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:39:19,811 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:39:19,812 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-59.i [2025-03-03 18:39:20,902 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a3f20d4/ae95e9293561469792f911b776b6bf61/FLAG8191db14c [2025-03-03 18:39:21,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:39:21,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-03-03 18:39:21,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a3f20d4/ae95e9293561469792f911b776b6bf61/FLAG8191db14c [2025-03-03 18:39:21,469 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a3f20d4/ae95e9293561469792f911b776b6bf61 [2025-03-03 18:39:21,471 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:39:21,473 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:39:21,474 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:39:21,474 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:39:21,477 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:39:21,478 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54033f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21, skipping insertion in model container [2025-03-03 18:39:21,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,496 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:39:21,591 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-59.i[919,932] [2025-03-03 18:39:21,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:39:21,627 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:39:21,634 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-59.i[919,932] [2025-03-03 18:39:21,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:39:21,662 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:39:21,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21 WrapperNode [2025-03-03 18:39:21,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:39:21,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:39:21,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:39:21,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:39:21,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,700 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2025-03-03 18:39:21,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:39:21,701 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:39:21,701 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:39:21,701 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:39:21,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,724 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 18:39:21,724 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,724 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,734 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,740 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,741 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,747 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:39:21,748 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:39:21,748 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:39:21,748 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:39:21,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (1/1) ... [2025-03-03 18:39:21,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:39:21,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:39:21,775 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 18:39:21,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 18:39:21,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:39:21,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 18:39:21,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 18:39:21,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:39:21,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:39:21,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:39:21,839 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:39:21,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:39:22,080 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-03 18:39:22,080 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:39:22,087 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:39:22,087 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:39:22,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:39:22 BoogieIcfgContainer [2025-03-03 18:39:22,088 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:39:22,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:39:22,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:39:22,093 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:39:22,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:39:21" (1/3) ... [2025-03-03 18:39:22,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5277bfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:39:22, skipping insertion in model container [2025-03-03 18:39:22,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:39:21" (2/3) ... [2025-03-03 18:39:22,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5277bfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:39:22, skipping insertion in model container [2025-03-03 18:39:22,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:39:22" (3/3) ... [2025-03-03 18:39:22,096 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2025-03-03 18:39:22,107 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:39:22,108 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_dependencies_file-59.i that has 2 procedures, 51 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:39:22,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:39:22,150 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;@37ee6204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:39:22,150 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:39:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 18:39:22,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 18:39:22,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:22,160 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:22,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:22,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:22,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1203039355, now seen corresponding path program 1 times [2025-03-03 18:39:22,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:22,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983815330] [2025-03-03 18:39:22,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:22,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 18:39:22,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 18:39:22,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:22,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-03 18:39:22,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:39:22,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983815330] [2025-03-03 18:39:22,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983815330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:39:22,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688538803] [2025-03-03 18:39:22,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:22,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:39:22,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:39:22,401 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:39:22,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 18:39:22,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 18:39:22,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 18:39:22,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:22,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:22,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 18:39:22,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:39:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-03 18:39:22,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:39:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688538803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:39:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:39:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 18:39:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733805776] [2025-03-03 18:39:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:39:22,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 18:39:22,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:39:22,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 18:39:22,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:39:22,561 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 35 states have internal predecessors, (48), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 18:39:22,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:39:22,579 INFO L93 Difference]: Finished difference Result 96 states and 161 transitions. [2025-03-03 18:39:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 18:39:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2025-03-03 18:39:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:39:22,585 INFO L225 Difference]: With dead ends: 96 [2025-03-03 18:39:22,585 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 18:39:22,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 18:39:22,589 INFO L435 NwaCegarLoop]: 71 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, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 18:39:22,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 18:39:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 18:39:22,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-03 18:39:22,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-03 18:39:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2025-03-03 18:39:22,612 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 93 [2025-03-03 18:39:22,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:39:22,613 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2025-03-03 18:39:22,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-03 18:39:22,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2025-03-03 18:39:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 18:39:22,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:22,615 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:22,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 18:39:22,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 18:39:22,816 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:22,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1144901407, now seen corresponding path program 1 times [2025-03-03 18:39:22,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:22,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675160368] [2025-03-03 18:39:22,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:22,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:22,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 18:39:22,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 18:39:22,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:22,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 18:39:23,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:39:23,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675160368] [2025-03-03 18:39:23,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675160368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:39:23,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:39:23,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:39:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788717427] [2025-03-03 18:39:23,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:39:23,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:39:23,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:39:23,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:39:23,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:39:23,186 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 18:39:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:39:23,301 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2025-03-03 18:39:23,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:39:23,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2025-03-03 18:39:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:39:23,303 INFO L225 Difference]: With dead ends: 139 [2025-03-03 18:39:23,303 INFO L226 Difference]: Without dead ends: 94 [2025-03-03 18:39:23,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:39:23,304 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 49 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:39:23,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 197 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:39:23,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-03 18:39:23,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 77. [2025-03-03 18:39:23,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-03 18:39:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 113 transitions. [2025-03-03 18:39:23,324 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 113 transitions. Word has length 93 [2025-03-03 18:39:23,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:39:23,324 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 113 transitions. [2025-03-03 18:39:23,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 18:39:23,325 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 113 transitions. [2025-03-03 18:39:23,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 18:39:23,326 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:23,326 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:23,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:39:23,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:23,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:23,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1221135147, now seen corresponding path program 1 times [2025-03-03 18:39:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:23,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341009285] [2025-03-03 18:39:23,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:23,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 18:39:23,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 18:39:23,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:23,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-03 18:39:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:39:23,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341009285] [2025-03-03 18:39:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341009285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:39:23,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:39:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:39:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794684085] [2025-03-03 18:39:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:39:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:39:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:39:23,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:39:23,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:39:23,600 INFO L87 Difference]: Start difference. First operand 77 states and 113 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 18:39:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:39:23,722 INFO L93 Difference]: Finished difference Result 176 states and 260 transitions. [2025-03-03 18:39:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:39:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2025-03-03 18:39:23,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:39:23,725 INFO L225 Difference]: With dead ends: 176 [2025-03-03 18:39:23,725 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 18:39:23,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:39:23,725 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 64 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 18:39:23,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 253 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 18:39:23,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 18:39:23,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2025-03-03 18:39:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 18:39:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2025-03-03 18:39:23,752 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 94 [2025-03-03 18:39:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:39:23,753 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 178 transitions. [2025-03-03 18:39:23,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-03 18:39:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 178 transitions. [2025-03-03 18:39:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 18:39:23,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:39:23,754 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:39:23,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:39:23,755 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:39:23,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:39:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1951714493, now seen corresponding path program 1 times [2025-03-03 18:39:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:39:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094925121] [2025-03-03 18:39:23,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:39:23,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 18:39:23,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 18:39:23,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:23,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:39:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859390196] [2025-03-03 18:39:23,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:39:23,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:39:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:39:23,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:39:23,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 18:39:23,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 18:39:24,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 18:39:24,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:39:24,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:39:24,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 18:39:24,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:39:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 18:39:25,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:39:37,488 WARN L286 SmtUtils]: Spent 6.28s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 18:40:01,843 WARN L286 SmtUtils]: Spent 10.61s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-03 18:40:17,825 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 18:40:22,014 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse2 (div (mod c_~var_1_6~0 65536) .cse7)) (.cse6 (mod c_~var_1_19~0 4294967296))) (let ((.cse1 (+ .cse6 1)) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse4 (mod c_~var_1_17~0 65536)) (.cse3 (+ (mod c_~var_1_7~0 65536) .cse7 1)) (.cse5 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (and (or (< .cse0 .cse1) (not (= (mod (* .cse2 .cse0) 4294967296) .cse0))) (forall ((v_z_5 Int)) (or (< v_z_5 .cse3) (not (= v_z_5 (mod (* v_z_5 .cse2) 4294967296))) (< .cse4 v_z_5) (< v_z_5 .cse1))) (or (not (= .cse5 .cse0)) (< .cse6 .cse0)) (or (< .cse4 .cse5) (< .cse5 .cse3) (< .cse6 .cse5)))))) is different from false [2025-03-03 18:40:40,150 WARN L286 SmtUtils]: Spent 12.16s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 18:40:54,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:40:54,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094925121] [2025-03-03 18:40:54,594 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 18:40:54,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859390196] [2025-03-03 18:40:54,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859390196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:40:54,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:40:54,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-03 18:40:54,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643852555] [2025-03-03 18:40:54,594 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 18:40:54,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 18:40:54,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:40:54,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 18:40:54,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=507, Unknown=2, NotChecked=50, Total=756 [2025-03-03 18:40:54,599 INFO L87 Difference]: Start difference. First operand 120 states and 178 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 18:40:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:40:59,817 INFO L93 Difference]: Finished difference Result 299 states and 391 transitions. [2025-03-03 18:40:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 18:40:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 95 [2025-03-03 18:40:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:40:59,819 INFO L225 Difference]: With dead ends: 299 [2025-03-03 18:40:59,819 INFO L226 Difference]: Without dead ends: 211 [2025-03-03 18:40:59,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=313, Invalid=811, Unknown=2, NotChecked=64, Total=1190 [2025-03-03 18:40:59,821 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:40:59,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 293 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 18:40:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-03-03 18:40:59,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 180. [2025-03-03 18:40:59,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 119 states have (on average 1.134453781512605) internal successors, (135), 119 states have internal predecessors, (135), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-03-03 18:40:59,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 219 transitions. [2025-03-03 18:40:59,841 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 219 transitions. Word has length 95 [2025-03-03 18:40:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:40:59,842 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 219 transitions. [2025-03-03 18:40:59,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 6 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2025-03-03 18:40:59,842 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 219 transitions. [2025-03-03 18:40:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 18:40:59,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:40:59,843 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:40:59,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 18:41:00,043 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-03 18:41:00,044 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:41:00,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:41:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash 403221352, now seen corresponding path program 1 times [2025-03-03 18:41:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:41:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451639883] [2025-03-03 18:41:00,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:41:00,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 18:41:00,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 18:41:00,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:00,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 18:41:00,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1530112773] [2025-03-03 18:41:00,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:41:00,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:00,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:41:00,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 18:41:00,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 18:41:00,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 18:41:00,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 18:41:00,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:00,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:41:00,522 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 18:41:00,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 18:41:00,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 18:41:00,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:41:00,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 18:41:00,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 18:41:00,601 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 18:41:00,602 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 18:41:00,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 18:41:00,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:41:00,806 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-03 18:41:00,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 18:41:00,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 06:41:00 BoogieIcfgContainer [2025-03-03 18:41:00,852 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 18:41:00,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 18:41:00,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 18:41:00,853 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 18:41:00,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:39:22" (3/4) ... [2025-03-03 18:41:00,855 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 18:41:00,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 18:41:00,856 INFO L158 Benchmark]: Toolchain (without parser) took 99383.02ms. Allocated memory is still 167.8MB. Free memory was 127.7MB in the beginning and 48.1MB in the end (delta: 79.6MB). Peak memory consumption was 82.2MB. Max. memory is 16.1GB. [2025-03-03 18:41:00,856 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:00,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.65ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 113.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:41:00,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.60ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 110.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:00,856 INFO L158 Benchmark]: Boogie Preprocessor took 46.48ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 104.7MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 18:41:00,857 INFO L158 Benchmark]: IcfgBuilder took 339.28ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 82.7MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 18:41:00,857 INFO L158 Benchmark]: TraceAbstraction took 98762.91ms. Allocated memory is still 167.8MB. Free memory was 82.3MB in the beginning and 48.2MB in the end (delta: 34.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. [2025-03-03 18:41:00,857 INFO L158 Benchmark]: Witness Printer took 2.58ms. Allocated memory is still 167.8MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 18:41:00,858 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.19ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.65ms. Allocated memory is still 167.8MB. Free memory was 127.3MB in the beginning and 113.7MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.60ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 110.4MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.48ms. Allocated memory is still 167.8MB. Free memory was 110.4MB in the beginning and 104.7MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 339.28ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 82.7MB in the end (delta: 22.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 98762.91ms. Allocated memory is still 167.8MB. Free memory was 82.3MB in the beginning and 48.2MB in the end (delta: 34.1MB). Peak memory consumption was 40.3MB. Max. memory is 16.1GB. * Witness Printer took 2.58ms. Allocated memory is still 167.8MB. Free memory was 48.2MB in the beginning and 48.1MB in the end (delta: 50.8kB). 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 someBinaryDOUBLEComparisonOperation at line 47, overapproximation of someBinaryDOUBLEComparisonOperation at line 123, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 54, overapproximation of someBinaryDOUBLEComparisonOperation at line 104. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 1; [L23] unsigned char var_1_4 = 25; [L24] unsigned short int var_1_5 = 0; [L25] unsigned short int var_1_6 = 62100; [L26] unsigned short int var_1_7 = 27651; [L27] double var_1_8 = 128.9; [L28] double var_1_10 = 16.5; [L29] double var_1_11 = 25.5; [L30] double var_1_12 = 199.75; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_15 = 1; [L34] unsigned char var_1_16 = 1; [L35] unsigned short int var_1_17 = 32; [L36] unsigned char var_1_18 = 1; [L37] unsigned long int var_1_19 = 1; [L38] unsigned short int last_1_var_1_5 = 0; [L39] unsigned char last_1_var_1_15 = 1; [L40] unsigned char last_1_var_1_18 = 1; [L41] unsigned long int last_1_var_1_19 = 1; VAL [isInitial=0, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L117] last_1_var_1_5 = var_1_5 [L118] last_1_var_1_15 = var_1_15 [L119] last_1_var_1_18 = var_1_18 [L120] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=25, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L95] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L96] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=62100, var_1_7=27651, var_1_8=1289/10] [L97] var_1_6 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L98] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L99] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L99] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=27651, var_1_8=1289/10] [L100] var_1_7 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L101] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L102] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L102] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=33/2, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L103] var_1_10 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L104] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_11=51/2, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L105] var_1_11 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L106] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_12=799/4, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L107] var_1_12 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L108] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L109] var_1_14 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L110] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L111] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L111] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L112] var_1_16 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L113] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L114] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L114] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE \read(last_1_var_1_18) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=1289/10] [L46] COND TRUE (! last_1_var_1_15) || (last_1_var_1_19 < var_1_6) [L47] var_1_8 = ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L54] COND TRUE var_1_12 != var_1_8 [L55] var_1_15 = (! var_1_16) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=32, var_1_18=1, var_1_19=1, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L59] var_1_17 = var_1_4 [L60] var_1_18 = var_1_16 [L61] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=1, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L62] COND FALSE !((var_1_17 != (16 / var_1_4)) && var_1_15) [L73] var_1_1 = var_1_17 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L75] COND FALSE !(var_1_17 < last_1_var_1_5) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=0, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L78] COND TRUE ! var_1_15 [L79] var_1_5 = ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L82] COND TRUE var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L83] COND TRUE var_1_5 <= var_1_6 [L84] var_1_13 = 32 VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L132] RET step() [L133] CALL, EXPR property() [L123-L124] return (((((((((var_1_17 != (16 / var_1_4)) && var_1_15) ? ((var_1_17 > var_1_4) ? (var_1_1 == ((unsigned short int) (var_1_4 + var_1_17))) : (var_1_15 ? (var_1_1 == ((unsigned short int) var_1_17)) : (var_1_1 == ((unsigned short int) var_1_4)))) : (var_1_1 == ((unsigned short int) var_1_17))) && ((var_1_17 < last_1_var_1_5) ? (var_1_5 == ((unsigned short int) (var_1_6 - (var_1_7 - last_1_var_1_5)))) : ((! var_1_15) ? (var_1_5 == ((unsigned short int) ((((last_1_var_1_5) > ((var_1_7 + var_1_4))) ? (last_1_var_1_5) : ((var_1_7 + var_1_4)))))) : 1))) && (last_1_var_1_18 ? (((! last_1_var_1_15) || (last_1_var_1_19 < var_1_6)) ? (var_1_8 == ((double) ((((127.25) > (var_1_10)) ? (127.25) : (var_1_10))))) : (var_1_8 == ((double) (var_1_11 + var_1_12)))) : (var_1_8 == ((double) var_1_11)))) && ((var_1_5 != ((var_1_6 / var_1_4) * ((((var_1_5) > (var_1_19)) ? (var_1_5) : (var_1_19))))) ? ((var_1_5 <= var_1_6) ? (var_1_13 == ((unsigned char) 32)) : (var_1_13 == ((unsigned char) var_1_14))) : (var_1_13 == ((unsigned char) var_1_14)))) && ((var_1_12 != var_1_8) ? (var_1_15 == ((unsigned char) (! var_1_16))) : (var_1_15 == ((unsigned char) var_1_16)))) && (var_1_17 == ((unsigned short int) var_1_4))) && (var_1_18 == ((unsigned char) var_1_16))) && (var_1_19 == ((unsigned long int) var_1_4)) ; VAL [\result=0, isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=1, last_1_var_1_18=1, last_1_var_1_19=1, last_1_var_1_5=0, var_1_10=0, var_1_13=32, var_1_14=0, var_1_15=0, var_1_16=1, var_1_17=255, var_1_18=1, var_1_19=255, var_1_1=255, var_1_4=255, var_1_5=16639, var_1_6=32894, var_1_7=-49152, var_1_8=509/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 98.7s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 814 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 553 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 563 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 261 mSDtfsCounter, 563 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 41.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=4, InterpolantAutomatonStates: 35, 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, 4 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 91.1s InterpolantComputationTime, 755 NumberOfCodeBlocks, 755 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 463 ConstructedInterpolants, 0 QuantifiedInterpolants, 2243 SizeOfPredicates, 7 NumberOfNonLiveVariables, 492 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1689/1820 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 18:41:00,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:41:02,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:41:02,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 18:41:02,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:41:02,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:41:02,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:41:02,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:41:02,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:41:02,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:41:02,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:41:02,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:41:02,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:41:02,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:41:02,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:41:02,748 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:41:02,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:41:02,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:41:02,748 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:41:02,749 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:41:02,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:41:02,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 18:41:02,750 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:41:02,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:41:02,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:41:02,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:41:02,751 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2025-03-03 18:41:03,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:41:03,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:41:03,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:41:03,011 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:41:03,011 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:41:03,012 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-59.i [2025-03-03 18:41:04,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf3b7534/f21f1bacfb9e42df932e2e366debe068/FLAGa6a6f0de1 [2025-03-03 18:41:04,389 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:41:04,389 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2025-03-03 18:41:04,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf3b7534/f21f1bacfb9e42df932e2e366debe068/FLAGa6a6f0de1 [2025-03-03 18:41:04,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daf3b7534/f21f1bacfb9e42df932e2e366debe068 [2025-03-03 18:41:04,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:41:04,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:41:04,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:41:04,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:41:04,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:41:04,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:04" (1/1) ... [2025-03-03 18:41:04,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53466432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:41:04, skipping insertion in model container [2025-03-03 18:41:04,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:41:04" (1/1) ... [2025-03-03 18:41:04,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:41:04,859 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-59.i[919,932] [2025-03-03 18:41:04,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:41:04,910 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:41:04,917 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-59.i[919,932]