./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:12:36,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:12:36,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:12:36,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:12:36,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:12:36,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:12:36,852 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:12:36,852 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:12:36,853 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:12:36,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:12:36,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:12:36,856 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:12:36,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:12:36,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:12:36,857 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:12:36,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:12:36,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:12:36,858 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:12:36,859 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:12:36,859 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:12:36,859 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:12:36,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:12:36,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:12:36,862 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:12:36,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:12:36,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:12:36,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:12:36,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:12:36,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:12:36,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:12:36,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:12:36,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:12:36,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:36,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:12:36,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:12:36,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:12:36,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:12:36,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:12:36,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:12:36,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:12:36,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:12:36,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:12:36,867 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 [2024-10-11 13:12:37,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:12:37,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:12:37,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:12:37,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:12:37,139 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:12:37,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i [2024-10-11 13:12:38,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:12:38,787 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:12:38,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i [2024-10-11 13:12:38,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ddc7b23d7/5665a187302f497c94b9e2afe698049c/FLAGf75014005 [2024-10-11 13:12:38,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ddc7b23d7/5665a187302f497c94b9e2afe698049c [2024-10-11 13:12:38,818 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:12:38,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:12:38,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:38,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:12:38,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:12:38,828 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78eb153d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:38, skipping insertion in model container [2024-10-11 13:12:38,829 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:38" (1/1) ... [2024-10-11 13:12:38,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:12:39,066 WARN L248 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-99.i[913,926] [2024-10-11 13:12:39,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:39,140 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:12:39,157 WARN L248 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-99.i[913,926] [2024-10-11 13:12:39,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:39,212 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:12:39,213 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39 WrapperNode [2024-10-11 13:12:39,213 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:39,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:39,215 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:12:39,215 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:12:39,221 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,268 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-11 13:12:39,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:39,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:12:39,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:12:39,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:12:39,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,288 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,311 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]. [2024-10-11 13:12:39,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,322 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,340 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:12:39,342 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:12:39,342 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:12:39,342 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:12:39,343 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (1/1) ... [2024-10-11 13:12:39,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:39,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:12:39,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:12:39,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:12:39,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:12:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:12:39,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:12:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:12:39,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:12:39,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:12:39,488 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:12:39,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:12:39,711 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 13:12:39,711 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:12:39,759 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:12:39,761 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:12:39,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:39 BoogieIcfgContainer [2024-10-11 13:12:39,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:12:39,765 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:12:39,765 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:12:39,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:12:39,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:12:38" (1/3) ... [2024-10-11 13:12:39,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704ac4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:39, skipping insertion in model container [2024-10-11 13:12:39,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:39" (2/3) ... [2024-10-11 13:12:39,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@704ac4e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:39, skipping insertion in model container [2024-10-11 13:12:39,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:39" (3/3) ... [2024-10-11 13:12:39,774 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-99.i [2024-10-11 13:12:39,791 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:12:39,792 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:12:39,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:12:39,850 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;@7e57cf8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:12:39,851 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:12:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:12:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:12:39,864 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:39,865 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:39,866 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash -253234748, now seen corresponding path program 1 times [2024-10-11 13:12:39,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:12:39,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725873520] [2024-10-11 13:12:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:39,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:12:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:12:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:12:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:12:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 13:12:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 13:12:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 13:12:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 13:12:40,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 13:12:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 13:12:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 13:12:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 13:12:40,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 13:12:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:12:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 13:12:40,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 13:12:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 13:12:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:12:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:12:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 13:12:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 13:12:40,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:12:40,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725873520] [2024-10-11 13:12:40,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725873520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:12:40,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:12:40,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:12:40,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245864857] [2024-10-11 13:12:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:12:40,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:12:40,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:12:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:12:40,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:40,292 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:12:40,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:12:40,338 INFO L93 Difference]: Finished difference Result 97 states and 169 transitions. [2024-10-11 13:12:40,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:12:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-11 13:12:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:12:40,351 INFO L225 Difference]: With dead ends: 97 [2024-10-11 13:12:40,351 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 13:12:40,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:40,360 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:12:40,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:12:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 13:12:40,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 13:12:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:12:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-11 13:12:40,413 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 116 [2024-10-11 13:12:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:12:40,413 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-11 13:12:40,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:12:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-11 13:12:40,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:12:40,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:40,421 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:40,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:12:40,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:40,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 91003842, now seen corresponding path program 1 times [2024-10-11 13:12:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:12:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770865108] [2024-10-11 13:12:40,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:40,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:12:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 13:12:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [796435946] [2024-10-11 13:12:40,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:40,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:12:40,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:12:40,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 13:12:40,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 13:12:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:12:40,746 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:12:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:12:40,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:12:40,881 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:12:40,884 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:12:40,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 13:12:41,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 13:12:41,092 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 13:12:41,195 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:12:41,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:12:41 BoogieIcfgContainer [2024-10-11 13:12:41,199 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:12:41,200 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:12:41,200 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:12:41,201 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:12:41,201 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:39" (3/4) ... [2024-10-11 13:12:41,203 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:12:41,204 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:12:41,206 INFO L158 Benchmark]: Toolchain (without parser) took 2385.65ms. Allocated memory is still 167.8MB. Free memory was 97.6MB in the beginning and 127.4MB in the end (delta: -29.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:12:41,208 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:12:41,208 INFO L158 Benchmark]: CACSL2BoogieTranslator took 390.56ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 133.5MB in the end (delta: -36.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-10-11 13:12:41,208 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.93ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 131.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:12:41,209 INFO L158 Benchmark]: Boogie Preprocessor took 70.05ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:12:41,209 INFO L158 Benchmark]: RCFGBuilder took 419.97ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 110.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 13:12:41,209 INFO L158 Benchmark]: TraceAbstraction took 1434.47ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 128.4MB in the end (delta: -18.4MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. [2024-10-11 13:12:41,210 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:12:41,215 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.18ms. Allocated memory is still 167.8MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 390.56ms. Allocated memory is still 167.8MB. Free memory was 97.5MB in the beginning and 133.5MB in the end (delta: -36.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.93ms. Allocated memory is still 167.8MB. Free memory was 133.5MB in the beginning and 131.5MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.05ms. Allocated memory is still 167.8MB. Free memory was 131.5MB in the beginning and 128.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 419.97ms. Allocated memory is still 167.8MB. Free memory was 128.9MB in the beginning and 110.5MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1434.47ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 128.4MB in the end (delta: -18.4MB). Peak memory consumption was 69.7MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 167.8MB. Free memory was 128.4MB in the beginning and 127.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 100, overapproximation of someBinaryArithmeticFLOAToperation at line 42. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 255.5; [L23] unsigned char var_1_2 = 16; [L24] float var_1_4 = 1000000000000000.6; [L25] float var_1_5 = 500.5; [L26] float var_1_6 = 99999999999.5; [L27] unsigned char var_1_7 = 1; [L28] float var_1_8 = 127.25; [L29] float var_1_9 = 4.8; [L30] float var_1_10 = 0.4; [L31] signed long int var_1_11 = 0; [L32] signed long int var_1_12 = 256; [L33] signed long int var_1_13 = 25; [L34] signed long int var_1_14 = -5; [L35] signed short int var_1_15 = 2; [L36] signed long int var_1_16 = -50; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] FCALL updateLastVariables() [L108] CALL updateVariables() [L65] var_1_2 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L66] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L67] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L67] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_4=5000000000000003/5, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L68] var_1_4 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L69] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_5=1001/2, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L70] var_1_5 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L71] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_6=199999999999/2, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L72] var_1_6 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L73] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L74] var_1_7 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_8=509/4, var_1_9=24/5] [L75] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_8=509/4, var_1_9=24/5] [L76] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L76] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_8=509/4, var_1_9=24/5] [L77] var_1_8 = __VERIFIER_nondet_float() [L78] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_9=24/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_9=24/5] [L78] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1, var_1_9=24/5] [L79] var_1_9 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L80] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L81] var_1_10 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L82] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=256, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L83] var_1_12 = __VERIFIER_nondet_long() [L84] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L84] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L85] CALL assume_abort_if_not(var_1_12 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L85] RET assume_abort_if_not(var_1_12 <= 2147483646) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=25, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L86] var_1_13 = __VERIFIER_nondet_long() [L87] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L87] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L88] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L88] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=2, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L89] var_1_15 = __VERIFIER_nondet_short() [L90] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L90] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L91] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L91] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L92] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L92] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=-50, var_1_1=511/2, var_1_2=3, var_1_7=1] [L93] var_1_16 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_16 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L94] RET assume_abort_if_not(var_1_16 >= -1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L95] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L95] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L108] RET updateVariables() [L109] CALL step() [L40] signed long int stepLocal_0 = (((8) < 0 ) ? -(8) : (8)); VAL [isInitial=1, stepLocal_0=8, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_1=511/2, var_1_2=3, var_1_7=1] [L41] COND TRUE (((((200) < (128)) ? (200) : (128))) - var_1_2) > stepLocal_0 [L42] var_1_1 = (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6) VAL [isInitial=1, var_1_11=0, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_2=3, var_1_7=1] [L48] COND TRUE (var_1_5 + var_1_6) == var_1_1 [L49] var_1_11 = (((((var_1_2) < (var_1_12)) ? (var_1_2) : (var_1_12))) - var_1_13) VAL [isInitial=1, var_1_11=2, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_2=3, var_1_7=1] [L53] signed long int stepLocal_1 = var_1_12 % var_1_15; VAL [isInitial=1, stepLocal_1=0, var_1_11=2, var_1_12=3, var_1_13=1, var_1_14=-5, var_1_15=1, var_1_16=0, var_1_2=3, var_1_7=1] [L54] COND TRUE var_1_9 == var_1_4 [L55] var_1_14 = var_1_13 VAL [isInitial=1, stepLocal_1=0, var_1_11=2, var_1_12=3, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_2=3, var_1_7=1] [L109] RET step() [L110] CALL, EXPR property() [L100-L101] return ((((((((200) < (128)) ? (200) : (128))) - var_1_2) > ((((8) < 0 ) ? -(8) : (8)))) ? (var_1_1 == ((float) (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))) - var_1_6))) : (var_1_7 ? (var_1_1 == ((float) (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) + var_1_10))) : 1)) && (((var_1_5 + var_1_6) == var_1_1) ? (var_1_11 == ((signed long int) (((((var_1_2) < (var_1_12)) ? (var_1_2) : (var_1_12))) - var_1_13))) : (var_1_11 == ((signed long int) var_1_13)))) && ((var_1_9 == var_1_4) ? (var_1_14 == ((signed long int) var_1_13)) : (((var_1_12 % var_1_15) != var_1_13) ? (var_1_14 == ((signed long int) ((((((var_1_15 + var_1_2) + var_1_16)) > (var_1_13)) ? (((var_1_15 + var_1_2) + var_1_16)) : (var_1_13))))) : (var_1_14 == ((signed long int) var_1_16)))) ; [L110] RET, EXPR property() [L110] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=2, var_1_12=3, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_2=3, var_1_7=1] [L19] reach_error() VAL [isInitial=1, var_1_11=2, var_1_12=3, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_2=3, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 19, 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, 68 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 68 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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.3s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 115 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 684/684 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 13:12:41,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:12:43,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:12:43,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:12:43,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:12:43,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:12:43,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:12:43,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:12:43,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:12:43,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:12:43,564 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:12:43,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:12:43,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:12:43,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:12:43,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:12:43,566 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:12:43,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:12:43,567 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:12:43,567 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:12:43,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:12:43,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:12:43,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:12:43,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:12:43,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:12:43,569 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:12:43,569 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:12:43,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:12:43,570 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:12:43,570 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:12:43,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:12:43,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:12:43,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:12:43,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:12:43,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:12:43,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:12:43,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:43,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:12:43,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:12:43,575 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:12:43,575 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:12:43,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:12:43,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:12:43,577 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:12:43,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:12:43,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:12:43,577 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:12:43,577 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> dcce0cb200f0b6b82254c63bdf1faa4faeaaad1e486287e1ff6c761f60d02606 [2024-10-11 13:12:43,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:12:43,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:12:43,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:12:43,966 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:12:43,966 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:12:43,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i [2024-10-11 13:12:45,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:12:45,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:12:45,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-99.i [2024-10-11 13:12:45,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bcc6deae/7d70ffefca734c7e84d3ce3c622d0027/FLAG944c8682a [2024-10-11 13:12:45,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8bcc6deae/7d70ffefca734c7e84d3ce3c622d0027 [2024-10-11 13:12:45,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:12:45,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:12:45,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:45,865 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:12:45,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:12:45,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:45" (1/1) ... [2024-10-11 13:12:45,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ebafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:45, skipping insertion in model container [2024-10-11 13:12:45,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:12:45" (1/1) ... [2024-10-11 13:12:45,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:12:46,080 WARN L248 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-99.i[913,926] [2024-10-11 13:12:46,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:46,164 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:12:46,177 WARN L248 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-99.i[913,926] [2024-10-11 13:12:46,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:12:46,244 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:12:46,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46 WrapperNode [2024-10-11 13:12:46,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:12:46,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:46,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:12:46,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:12:46,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,270 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,300 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-10-11 13:12:46,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:12:46,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:12:46,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:12:46,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:12:46,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,337 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]. [2024-10-11 13:12:46,341 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:12:46,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:12:46,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:12:46,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:12:46,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (1/1) ... [2024-10-11 13:12:46,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:12:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:12:46,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:12:46,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:12:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:12:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:12:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:12:46,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:12:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:12:46,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:12:46,555 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:12:46,557 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:12:47,218 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 13:12:47,220 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:12:47,300 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:12:47,302 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:12:47,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:47 BoogieIcfgContainer [2024-10-11 13:12:47,303 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:12:47,305 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:12:47,305 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:12:47,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:12:47,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:12:45" (1/3) ... [2024-10-11 13:12:47,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5ca49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:47, skipping insertion in model container [2024-10-11 13:12:47,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:12:46" (2/3) ... [2024-10-11 13:12:47,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5ca49b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:12:47, skipping insertion in model container [2024-10-11 13:12:47,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:12:47" (3/3) ... [2024-10-11 13:12:47,314 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-99.i [2024-10-11 13:12:47,330 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:12:47,331 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:12:47,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:12:47,425 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7cf68b71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:12:47,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:12:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:12:47,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:12:47,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:47,443 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:47,443 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:47,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:47,450 INFO L85 PathProgramCache]: Analyzing trace with hash -253234748, now seen corresponding path program 1 times [2024-10-11 13:12:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:12:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303016526] [2024-10-11 13:12:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:47,465 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 [2024-10-11 13:12:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:12:47,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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) [2024-10-11 13:12:47,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 13:12:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:47,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:12:47,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:12:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-10-11 13:12:47,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:12:47,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:12:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303016526] [2024-10-11 13:12:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303016526] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:12:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:12:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:12:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852492760] [2024-10-11 13:12:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:12:47,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:12:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:12:47,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:12:47,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:47,880 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 states have internal predecessors, (38), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:12:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:12:48,524 INFO L93 Difference]: Finished difference Result 97 states and 169 transitions. [2024-10-11 13:12:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:12:48,543 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-11 13:12:48,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:12:48,550 INFO L225 Difference]: With dead ends: 97 [2024-10-11 13:12:48,550 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 13:12:48,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:12:48,559 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:12:48,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:12:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 13:12:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 13:12:48,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 13:12:48,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-11 13:12:48,614 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 116 [2024-10-11 13:12:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:12:48,615 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-11 13:12:48,615 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 13:12:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-11 13:12:48,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 13:12:48,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:12:48,620 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:12:48,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 13:12:48,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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 [2024-10-11 13:12:48,822 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:12:48,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:12:48,823 INFO L85 PathProgramCache]: Analyzing trace with hash 91003842, now seen corresponding path program 1 times [2024-10-11 13:12:48,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:12:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468472896] [2024-10-11 13:12:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:12:48,824 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 [2024-10-11 13:12:48,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:12:48,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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) [2024-10-11 13:12:48,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 13:12:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:12:49,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 13:12:49,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:13:05,018 WARN L286 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 13:13:32,255 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)