./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_variablewrapping_normal_file-1.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 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:07:57,188 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:07:57,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:07:57,226 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:07:57,227 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:07:57,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:07:57,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:07:57,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:07:57,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:07:57,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:07:57,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:07:57,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:07:57,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:07:57,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:07:57,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:07:57,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:07:57,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:07:57,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:07:57,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:07:57,243 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 -> 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 [2025-03-17 05:07:57,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:07:57,445 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:07:57,447 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:07:57,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:07:57,449 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:07:57,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2025-03-17 05:07:58,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5662a4af6/82e6e954a29d44a681ededf44fbf497a/FLAG4756b3f57 [2025-03-17 05:07:58,791 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:07:58,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2025-03-17 05:07:58,800 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5662a4af6/82e6e954a29d44a681ededf44fbf497a/FLAG4756b3f57 [2025-03-17 05:07:59,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5662a4af6/82e6e954a29d44a681ededf44fbf497a [2025-03-17 05:07:59,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:07:59,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:07:59,139 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:07:59,139 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:07:59,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:07:59,142 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,143 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403db08f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59, skipping insertion in model container [2025-03-17 05:07:59,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:07:59,268 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_variablewrapping_normal_file-1.i[912,925] [2025-03-17 05:07:59,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:07:59,324 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:07:59,333 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_variablewrapping_normal_file-1.i[912,925] [2025-03-17 05:07:59,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:07:59,360 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:07:59,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59 WrapperNode [2025-03-17 05:07:59,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:07:59,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:07:59,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:07:59,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:07:59,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,402 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-17 05:07:59,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:07:59,406 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:07:59,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:07:59,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:07:59,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,433 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-17 05:07:59,434 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,434 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,438 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:07:59,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:07:59,454 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:07:59,454 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:07:59,455 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (1/1) ... [2025-03-17 05:07:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:07:59,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:07:59,482 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-17 05:07:59,484 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-17 05:07:59,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:07:59,504 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:07:59,504 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:07:59,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:07:59,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:07:59,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:07:59,552 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:07:59,554 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:07:59,726 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L97: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2025-03-17 05:07:59,759 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-17 05:07:59,760 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:07:59,771 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:07:59,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:07:59,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:07:59 BoogieIcfgContainer [2025-03-17 05:07:59,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:07:59,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:07:59,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:07:59,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:07:59,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:07:59" (1/3) ... [2025-03-17 05:07:59,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e965110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:07:59, skipping insertion in model container [2025-03-17 05:07:59,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:07:59" (2/3) ... [2025-03-17 05:07:59,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e965110 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:07:59, skipping insertion in model container [2025-03-17 05:07:59,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:07:59" (3/3) ... [2025-03-17 05:07:59,781 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-1.i [2025-03-17 05:07:59,792 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:07:59,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-1.i that has 2 procedures, 52 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:07:59,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:07:59,845 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;@6f54f05f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:07:59,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:07:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 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-17 05:07:59,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:07:59,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:07:59,858 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-17 05:07:59,858 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:07:59,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:07:59,862 INFO L85 PathProgramCache]: Analyzing trace with hash -729283699, now seen corresponding path program 1 times [2025-03-17 05:07:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:07:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931073432] [2025-03-17 05:07:59,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:07:59,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:07:59,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:07:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:07:59,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:07:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:00,047 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-17 05:08:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:08:00,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931073432] [2025-03-17 05:08:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931073432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:08:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581463987] [2025-03-17 05:08:00,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:00,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:08:00,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:08:00,052 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-17 05:08:00,054 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-17 05:08:00,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:08:00,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:08:00,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:00,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:00,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:08:00,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:08:00,195 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-17 05:08:00,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:08:00,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581463987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:08:00,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:08:00,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:08:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454026007] [2025-03-17 05:08:00,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:08:00,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:08:00,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:08:00,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:08:00,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:08:00,219 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 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-17 05:08:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:08:00,242 INFO L93 Difference]: Finished difference Result 101 states and 164 transitions. [2025-03-17 05:08:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:08:00,245 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-17 05:08:00,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:08:00,251 INFO L225 Difference]: With dead ends: 101 [2025-03-17 05:08:00,251 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 05:08:00,255 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-17 05:08:00,258 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:08:00,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:08:00,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 05:08:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-17 05:08:00,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 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-17 05:08:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2025-03-17 05:08:00,294 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 93 [2025-03-17 05:08:00,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:08:00,295 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2025-03-17 05:08:00,295 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-17 05:08:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2025-03-17 05:08:00,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:08:00,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:00,300 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-17 05:08:00,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:08:00,501 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-17 05:08:00,502 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:00,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:00,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1800502735, now seen corresponding path program 1 times [2025-03-17 05:08:00,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:08:00,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832714349] [2025-03-17 05:08:00,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:00,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:08:00,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:08:00,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:08:00,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:00,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:08:00,603 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:08:00,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:08:00,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:08:00,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:00,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:08:00,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:08:00,690 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:08:00,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:08:00,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:08:00,695 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-17 05:08:00,750 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:08:00,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:08:00 BoogieIcfgContainer [2025-03-17 05:08:00,753 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:08:00,754 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:08:00,754 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:08:00,754 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:08:00,755 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:07:59" (3/4) ... [2025-03-17 05:08:00,756 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:08:00,758 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:08:00,759 INFO L158 Benchmark]: Toolchain (without parser) took 1621.31ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 93.3MB in the end (delta: 17.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2025-03-17 05:08:00,759 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:00,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.56ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:08:00,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.38ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:08:00,759 INFO L158 Benchmark]: Boogie Preprocessor took 47.23ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:00,760 INFO L158 Benchmark]: IcfgBuilder took 318.68ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:08:00,760 INFO L158 Benchmark]: TraceAbstraction took 978.93ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 94.1MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:00,760 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.3MB in the end (delta: 776.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:08:00,761 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.43ms. Allocated memory is still 201.3MB. Free memory is still 124.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.56ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.1MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.38ms. Allocated memory is still 142.6MB. Free memory was 98.1MB in the beginning and 95.6MB in the end (delta: 2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.23ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 93.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 318.68ms. Allocated memory is still 142.6MB. Free memory was 93.6MB in the beginning and 76.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 978.93ms. Allocated memory is still 142.6MB. Free memory was 75.9MB in the beginning and 94.1MB in the end (delta: -18.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 93.3MB in the end (delta: 776.2kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someUnaryFLOAToperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 5.5; [L23] float var_1_2 = 10.375; [L24] float var_1_3 = 127.5; [L25] float var_1_4 = 256.2; [L26] unsigned char var_1_5 = 1; [L27] signed long int var_1_6 = 5; [L28] unsigned char var_1_7 = 1; [L29] signed long int var_1_10 = 32; [L30] signed long int var_1_11 = 2; [L31] unsigned long int var_1_12 = 16; [L32] unsigned char var_1_13 = 50; [L33] signed long int var_1_15 = 100000000; [L34] signed short int var_1_16 = 2; [L35] unsigned long int last_1_var_1_12 = 16; [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_12 = var_1_12 [L104] RET updateLastVariables() [L105] CALL updateVariables() [L70] var_1_2 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L71] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_3=255/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L72] var_1_3 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L73] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_4=1281/5, var_1_5=1, var_1_6=5, var_1_7=1] [L74] var_1_4 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L75] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L76] var_1_5 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L77] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_6=5, var_1_7=1] [L78] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L78] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=1] [L79] var_1_7 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5] [L81] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L81] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=32, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L82] var_1_10 = __VERIFIER_nondet_long() [L83] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L83] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L84] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L84] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=2, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L85] var_1_11 = __VERIFIER_nondet_long() [L86] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L86] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L87] CALL assume_abort_if_not(var_1_11 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L87] RET assume_abort_if_not(var_1_11 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=50, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L88] var_1_13 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L89] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L90] CALL assume_abort_if_not(var_1_13 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L90] RET assume_abort_if_not(var_1_13 <= 255) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L91] CALL assume_abort_if_not(var_1_13 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L91] RET assume_abort_if_not(var_1_13 != 0) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=11/2, var_1_5=1, var_1_6=5, var_1_7=-255] [L105] RET updateVariables() [L106] CALL step() [L39] COND TRUE var_1_2 <= (- var_1_3) [L40] var_1_1 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=2, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=5, var_1_7=-255] [L48] var_1_16 = var_1_13 [L49] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_0=-255, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=5, var_1_7=-255] [L50] COND TRUE var_1_5 || stepLocal_0 [L51] var_1_6 = ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L55] signed long int stepLocal_3 = var_1_11; [L56] signed long int stepLocal_2 = var_1_16 + var_1_11; VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L57] EXPR var_1_11 << var_1_16 VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L57] signed long int stepLocal_1 = var_1_11 << var_1_16; [L58] COND FALSE !(stepLocal_1 != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) VAL [isInitial=1, last_1_var_1_12=16, stepLocal_2=1, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=100000000, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L67] var_1_15 = var_1_16 [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L97-L98] return (((((var_1_2 <= (- var_1_3)) ? (var_1_1 == ((float) ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))))) : (var_1_5 ? (var_1_1 == ((float) var_1_4)) : (var_1_1 == ((float) var_1_4)))) && ((var_1_5 || var_1_7) ? (var_1_6 == ((signed long int) ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))))) : (var_1_6 == ((signed long int) ((var_1_10 + var_1_11) - 4))))) && (((var_1_11 << var_1_16) != ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))) ? (((var_1_16 % var_1_13) >= var_1_11) ? (((var_1_16 + var_1_11) > (last_1_var_1_12 * var_1_16)) ? (var_1_12 == ((unsigned long int) var_1_13)) : (var_1_12 == ((unsigned long int) var_1_10))) : 1) : 1)) && (var_1_15 == ((signed long int) var_1_16))) && (var_1_16 == ((signed short int) var_1_13)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=16, var_1_10=0, var_1_11=0, var_1_12=16, var_1_13=1, var_1_15=1, var_1_16=1, var_1_1=100000005, var_1_4=100000005, var_1_5=1, var_1_6=1, var_1_7=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 90 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2 IncrementalHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 70 mSDtfsCounter, 2 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 279 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 184 ConstructedInterpolants, 0 QuantifiedInterpolants, 184 SizeOfPredicates, 0 NumberOfNonLiveVariables, 227 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 702/728 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-17 05:08:00,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.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 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:08:02,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:08:02,800 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:08:02,804 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:08:02,805 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:08:02,828 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:08:02,830 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:08:02,830 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:08:02,830 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:08:02,830 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:08:02,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:08:02,830 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:08:02,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:08:02,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:08:02,831 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:08:02,831 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:08:02,832 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:08:02,832 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:08:02,832 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 -> 22d48377ba2b5807c6e679e35c40cf38e830cbb9db14f8a42a5558451489d0b8 [2025-03-17 05:08:03,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:08:03,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:08:03,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:08:03,111 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:08:03,111 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:08:03,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2025-03-17 05:08:04,313 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab18f5c78/813abf90b6a44cbf9dbd0e47077e8ae4/FLAGe07cb11ff [2025-03-17 05:08:04,509 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:08:04,510 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-1.i [2025-03-17 05:08:04,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab18f5c78/813abf90b6a44cbf9dbd0e47077e8ae4/FLAGe07cb11ff [2025-03-17 05:08:04,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab18f5c78/813abf90b6a44cbf9dbd0e47077e8ae4 [2025-03-17 05:08:04,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:08:04,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:08:04,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:08:04,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:08:04,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:08:04,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28e4178c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04, skipping insertion in model container [2025-03-17 05:08:04,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,558 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:08:04,661 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_variablewrapping_normal_file-1.i[912,925] [2025-03-17 05:08:04,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:08:04,719 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:08:04,728 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_variablewrapping_normal_file-1.i[912,925] [2025-03-17 05:08:04,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:08:04,768 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:08:04,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04 WrapperNode [2025-03-17 05:08:04,769 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:08:04,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:08:04,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:08:04,770 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:08:04,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,806 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2025-03-17 05:08:04,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:08:04,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:08:04,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:08:04,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:08:04,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,826 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-17 05:08:04,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,839 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,851 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:08:04,852 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:08:04,852 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:08:04,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:08:04,856 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (1/1) ... [2025-03-17 05:08:04,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:08:04,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:08:04,883 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-17 05:08:04,886 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-17 05:08:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:08:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:08:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:08:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:08:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:08:04,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:08:04,965 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:08:05,191 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-17 05:08:05,191 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:08:05,198 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:08:05,199 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:08:05,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:05 BoogieIcfgContainer [2025-03-17 05:08:05,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:08:05,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:08:05,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:08:05,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:08:05,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:08:04" (1/3) ... [2025-03-17 05:08:05,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496141e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:08:05, skipping insertion in model container [2025-03-17 05:08:05,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:08:04" (2/3) ... [2025-03-17 05:08:05,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@496141e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:08:05, skipping insertion in model container [2025-03-17 05:08:05,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:08:05" (3/3) ... [2025-03-17 05:08:05,208 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-1.i [2025-03-17 05:08:05,219 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:08:05,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_normal_file-1.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:08:05,255 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:08:05,263 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;@4c0bcbb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:08:05,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:08:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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-17 05:08:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:08:05,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:05,273 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] [2025-03-17 05:08:05,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:05,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1548210305, now seen corresponding path program 1 times [2025-03-17 05:08:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:08:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459069562] [2025-03-17 05:08:05,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:05,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:08:05,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:08:05,288 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:08:05,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-17 05:08:05,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:08:05,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:08:05,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:05,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:05,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:08:05,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:08:05,464 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-17 05:08:05,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:08:05,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:08:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459069562] [2025-03-17 05:08:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459069562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:08:05,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:08:05,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:08:05,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127117425] [2025-03-17 05:08:05,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:08:05,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:08:05,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:08:05,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:08:05,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:08:05,489 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-17 05:08:05,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:08:05,504 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2025-03-17 05:08:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:08:05,505 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 88 [2025-03-17 05:08:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:08:05,509 INFO L225 Difference]: With dead ends: 83 [2025-03-17 05:08:05,510 INFO L226 Difference]: Without dead ends: 41 [2025-03-17 05:08:05,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-17 05:08:05,514 INFO L435 NwaCegarLoop]: 60 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, 60 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-17 05:08:05,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:08:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-17 05:08:05,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-17 05:08:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-17 05:08:05,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2025-03-17 05:08:05,566 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 88 [2025-03-17 05:08:05,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:08:05,566 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2025-03-17 05:08:05,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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-17 05:08:05,567 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2025-03-17 05:08:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-17 05:08:05,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:08:05,569 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] [2025-03-17 05:08:05,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-17 05:08:05,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:08:05,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:08:05,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:08:05,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1608639909, now seen corresponding path program 1 times [2025-03-17 05:08:05,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:08:05,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027646728] [2025-03-17 05:08:05,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:08:05,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:08:05,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:08:05,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:08:05,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-17 05:08:05,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 05:08:05,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 05:08:05,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:08:05,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:08:05,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 05:08:05,922 INFO L279 TraceCheckSpWp]: Computing forward predicates...