./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f542c31fef0cbf1b152079c560a5961cfda40d4d893630cfcc2de70dbcc4c8b6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:16:03,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:16:03,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 01:16:03,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:16:03,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:16:03,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:16:03,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:16:03,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:16:03,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:16:03,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:16:03,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:16:03,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:16:03,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:16:03,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:16:03,329 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:16:03,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:16:03,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:16:03,330 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:16:03,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:16:03,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:16:03,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:16:03,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:16:03,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:16:03,333 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:16:03,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:16:03,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:16:03,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:16:03,334 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:16:03,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:16:03,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:16:03,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:16:03,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:16:03,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:16:03,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:16:03,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:16:03,335 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:16:03,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 01:16:03,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:16:03,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:16:03,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:16:03,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:16:03,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:16:03,338 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/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/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 -> f542c31fef0cbf1b152079c560a5961cfda40d4d893630cfcc2de70dbcc4c8b6 [2024-11-09 01:16:03,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:16:03,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:16:03,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:16:03,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:16:03,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:16:03,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i [2024-11-09 01:16:04,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:16:04,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:16:04,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i [2024-11-09 01:16:04,896 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f18b55d0/eadee27c3def4565b32cfda67b552fed/FLAGfeefd81c3 [2024-11-09 01:16:04,906 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f18b55d0/eadee27c3def4565b32cfda67b552fed [2024-11-09 01:16:04,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:16:04,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:16:04,912 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:16:04,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:16:04,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:16:04,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:16:04" (1/1) ... [2024-11-09 01:16:04,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513fa806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:04, skipping insertion in model container [2024-11-09 01:16:04,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:16:04" (1/1) ... [2024-11-09 01:16:04,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:16:05,073 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i[912,925] [2024-11-09 01:16:05,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:16:05,130 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:16:05,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i[912,925] [2024-11-09 01:16:05,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:16:05,209 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:16:05,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05 WrapperNode [2024-11-09 01:16:05,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:16:05,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:16:05,211 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:16:05,211 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:16:05,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,265 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-09 01:16:05,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:16:05,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:16:05,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:16:05,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:16:05,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,280 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,294 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-11-09 01:16:05,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,307 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:16:05,308 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:16:05,308 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:16:05,308 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:16:05,309 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (1/1) ... [2024-11-09 01:16:05,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:16:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:16:05,340 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:16:05,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:16:05,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:16:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:16:05,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:16:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 01:16:05,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:16:05,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:16:05,439 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:16:05,442 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:16:05,630 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:16:05,630 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:16:05,643 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:16:05,643 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:16:05,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:05 BoogieIcfgContainer [2024-11-09 01:16:05,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:16:05,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:16:05,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:16:05,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:16:05,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:16:04" (1/3) ... [2024-11-09 01:16:05,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d03c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:16:05, skipping insertion in model container [2024-11-09 01:16:05,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:05" (2/3) ... [2024-11-09 01:16:05,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63d03c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:16:05, skipping insertion in model container [2024-11-09 01:16:05,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:05" (3/3) ... [2024-11-09 01:16:05,657 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-0.i [2024-11-09 01:16:05,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:16:05,671 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:16:05,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:16:05,729 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;@32b1735, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:16:05,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:16:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 01:16:05,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:05,739 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:16:05,739 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:05,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:05,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1631651389, now seen corresponding path program 1 times [2024-11-09 01:16:05,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:16:05,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166014443] [2024-11-09 01:16:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 01:16:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 01:16:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 01:16:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 01:16:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-09 01:16:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 01:16:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 01:16:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 01:16:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 01:16:05,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 01:16:05,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166014443] [2024-11-09 01:16:05,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166014443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:05,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:05,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:16:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63578476] [2024-11-09 01:16:05,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:16:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 01:16:05,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:16:05,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:16:05,984 INFO L87 Difference]: Start difference. First operand has 41 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 01:16:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:06,004 INFO L93 Difference]: Finished difference Result 74 states and 120 transitions. [2024-11-09 01:16:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:16:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-11-09 01:16:06,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:06,012 INFO L225 Difference]: With dead ends: 74 [2024-11-09 01:16:06,014 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 01:16:06,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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-11-09 01:16:06,022 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:06,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 01:16:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 01:16:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-09 01:16:06,099 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 58 [2024-11-09 01:16:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:06,100 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-09 01:16:06,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 01:16:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-09 01:16:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 01:16:06,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:06,102 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:16:06,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:16:06,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:06,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:06,105 INFO L85 PathProgramCache]: Analyzing trace with hash -402914689, now seen corresponding path program 1 times [2024-11-09 01:16:06,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 01:16:06,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006581071] [2024-11-09 01:16:06,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:06,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:16:06,162 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 01:16:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 01:16:06,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 01:16:06,237 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 01:16:06,238 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 01:16:06,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:16:06,242 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 01:16:06,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 01:16:06,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 01:16:06 BoogieIcfgContainer [2024-11-09 01:16:06,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 01:16:06,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 01:16:06,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 01:16:06,288 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 01:16:06,289 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:05" (3/4) ... [2024-11-09 01:16:06,291 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 01:16:06,291 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 01:16:06,292 INFO L158 Benchmark]: Toolchain (without parser) took 1382.63ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 96.2MB in the beginning and 196.5MB in the end (delta: -100.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:16:06,292 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:16:06,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.63ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 136.6MB in the end (delta: -40.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-11-09 01:16:06,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.99ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 136.6MB in the beginning and 213.5MB in the end (delta: -77.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. [2024-11-09 01:16:06,293 INFO L158 Benchmark]: Boogie Preprocessor took 41.53ms. Allocated memory is still 243.3MB. Free memory was 213.5MB in the beginning and 210.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 01:16:06,294 INFO L158 Benchmark]: RCFGBuilder took 335.65ms. Allocated memory is still 243.3MB. Free memory was 210.4MB in the beginning and 195.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 01:16:06,294 INFO L158 Benchmark]: TraceAbstraction took 639.22ms. Allocated memory is still 243.3MB. Free memory was 194.7MB in the beginning and 197.6MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:16:06,294 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 243.3MB. Free memory was 197.6MB in the beginning and 196.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 01:16:06,296 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.15ms. Allocated memory is still 167.8MB. Free memory is still 120.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.63ms. Allocated memory is still 167.8MB. Free memory was 96.0MB in the beginning and 136.6MB in the end (delta: -40.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.99ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 136.6MB in the beginning and 213.5MB in the end (delta: -77.0MB). Peak memory consumption was 4.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.53ms. Allocated memory is still 243.3MB. Free memory was 213.5MB in the beginning and 210.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 335.65ms. Allocated memory is still 243.3MB. Free memory was 210.4MB in the beginning and 195.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 639.22ms. Allocated memory is still 243.3MB. Free memory was 194.7MB in the beginning and 197.6MB in the end (delta: -2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 243.3MB. Free memory was 197.6MB in the beginning and 196.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryArithmeticDOUBLEoperation at line 48. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.8; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 128.2; [L25] double var_1_4 = 15.4; [L26] double var_1_5 = 5.25; [L27] unsigned char var_1_9 = 1; [L28] unsigned char var_1_10 = 100; [L29] unsigned char var_1_12 = 1; [L30] unsigned short int var_1_13 = 5; [L31] double last_1_var_1_5 = 5.25; [L32] unsigned char last_1_var_1_10 = 100; [L33] unsigned short int last_1_var_1_13 = 5; VAL [isInitial=0, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L84] last_1_var_1_5 = var_1_5 [L85] last_1_var_1_10 = var_1_10 [L86] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L69] var_1_2 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L70] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L71] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L71] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L72] var_1_3 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L73] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_9=1] [L74] var_1_4 = __VERIFIER_nondet_double() [L75] 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, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=1] [L75] 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, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=1] [L76] var_1_9 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4] [L77] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4] [L78] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L78] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=1, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L79] var_1_12 = __VERIFIER_nondet_uchar() [L80] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L80] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L81] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L81] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L97] RET updateVariables() [L98] CALL step() [L37] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L42] COND FALSE !((last_1_var_1_13 + last_1_var_1_13) < last_1_var_1_13) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L47] COND TRUE ! var_1_2 [L48] var_1_1 = (var_1_3 - var_1_4) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_2=0, var_1_5=21/4, var_1_9=0] [L52] COND FALSE !((var_1_3 + (var_1_4 + var_1_1)) != var_1_1) [L65] var_1_5 = var_1_3 VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_2=0, var_1_3=259, var_1_5=259, var_1_9=0] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return ((((! var_1_2) ? (var_1_1 == ((double) (var_1_3 - var_1_4))) : (var_1_1 == ((double) ((((16.2) < (var_1_3)) ? (16.2) : (var_1_3)))))) && (((var_1_3 + (var_1_4 + var_1_1)) != var_1_1) ? (var_1_2 ? (((- var_1_13) <= var_1_10) ? (var_1_9 ? (var_1_5 == ((double) var_1_4)) : 1) : (var_1_5 == ((double) var_1_3))) : (var_1_5 == ((double) var_1_3))) : (var_1_5 == ((double) var_1_3)))) && (((last_1_var_1_13 + last_1_var_1_13) < last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? (var_1_10 == ((unsigned char) var_1_12)) : 1) : 1)) && (var_1_9 ? (((var_1_4 * (var_1_3 - 5.3)) <= last_1_var_1_5) ? (var_1_13 == ((unsigned short int) last_1_var_1_10)) : 1) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_2=0, var_1_3=259, var_1_5=259, var_1_9=0] [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_2=0, var_1_3=259, var_1_5=259, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, last_1_var_1_13=5, last_1_var_1_5=21/4, var_1_10=100, var_1_12=254, var_1_13=5, var_1_2=0, var_1_3=259, var_1_5=259, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 8, 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, 49 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 57 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 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-11-09 01:16:06,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f542c31fef0cbf1b152079c560a5961cfda40d4d893630cfcc2de70dbcc4c8b6 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 01:16:08,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:16:08,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 01:16:08,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:16:08,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:16:08,125 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:16:08,126 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:16:08,126 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:16:08,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 01:16:08,128 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 01:16:08,128 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:16:08,128 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:16:08,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 01:16:08,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 01:16:08,129 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 01:16:08,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:16:08,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:16:08,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:16:08,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:16:08,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:16:08,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:16:08,131 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:16:08,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:16:08,131 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 01:16:08,132 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 01:16:08,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:16:08,132 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 01:16:08,132 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:16:08,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:16:08,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:16:08,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:16:08,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 01:16:08,133 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:16:08,133 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:16:08,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:16:08,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:16:08,134 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:16:08,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:16:08,134 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 01:16:08,135 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 01:16:08,135 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:16:08,135 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 01:16:08,135 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 01:16:08,136 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:16:08,136 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/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/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 -> f542c31fef0cbf1b152079c560a5961cfda40d4d893630cfcc2de70dbcc4c8b6 [2024-11-09 01:16:08,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:16:08,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:16:08,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:16:08,422 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:16:08,423 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:16:08,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i [2024-11-09 01:16:09,759 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:16:09,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:16:09,908 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i [2024-11-09 01:16:09,916 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa1e57fc/a3fdc3d78ced46a787e8b280159cc020/FLAGb6217b923 [2024-11-09 01:16:09,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fa1e57fc/a3fdc3d78ced46a787e8b280159cc020 [2024-11-09 01:16:09,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:16:09,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:16:09,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:16:09,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:16:09,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:16:09,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:16:09" (1/1) ... [2024-11-09 01:16:09,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@223b1dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:09, skipping insertion in model container [2024-11-09 01:16:09,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:16:09" (1/1) ... [2024-11-09 01:16:09,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:16:10,107 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i[912,925] [2024-11-09 01:16:10,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:16:10,161 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:16:10,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-0.i[912,925] [2024-11-09 01:16:10,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:16:10,206 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:16:10,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10 WrapperNode [2024-11-09 01:16:10,207 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:16:10,208 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:16:10,208 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:16:10,208 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:16:10,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,246 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2024-11-09 01:16:10,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:16:10,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:16:10,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:16:10,247 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:16:10,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,276 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-11-09 01:16:10,276 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,276 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:16:10,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:16:10,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:16:10,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:16:10,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (1/1) ... [2024-11-09 01:16:10,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 01:16:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 01:16:10,330 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 01:16:10,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 01:16:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:16:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 01:16:10,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 01:16:10,367 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 01:16:10,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:16:10,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:16:10,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:16:10,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:16:22,163 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 01:16:22,165 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:16:22,174 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:16:22,174 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 01:16:22,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:22 BoogieIcfgContainer [2024-11-09 01:16:22,175 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:16:22,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:16:22,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:16:22,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:16:22,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:16:09" (1/3) ... [2024-11-09 01:16:22,179 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4d5a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:16:22, skipping insertion in model container [2024-11-09 01:16:22,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:16:10" (2/3) ... [2024-11-09 01:16:22,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e4d5a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:16:22, skipping insertion in model container [2024-11-09 01:16:22,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:16:22" (3/3) ... [2024-11-09 01:16:22,180 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-0.i [2024-11-09 01:16:22,191 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:16:22,192 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 01:16:22,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:16:22,241 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;@2b74f537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:16:22,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 01:16:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 01:16:22,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:22,252 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:16:22,253 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:22,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1631651389, now seen corresponding path program 1 times [2024-11-09 01:16:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:16:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [194374212] [2024-11-09 01:16:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:22,270 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-11-09 01:16:22,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:16:22,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:16:22,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 01:16:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:22,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 01:16:22,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-09 01:16:22,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 01:16:22,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 01:16:22,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [194374212] [2024-11-09 01:16:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [194374212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:16:22,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:16:22,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 01:16:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636131697] [2024-11-09 01:16:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:16:22,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 01:16:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 01:16:22,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 01:16:22,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 01:16:22,766 INFO L87 Difference]: Start difference. First operand has 41 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 31 states have internal predecessors, (44), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 01:16:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:22,780 INFO L93 Difference]: Finished difference Result 74 states and 120 transitions. [2024-11-09 01:16:22,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 01:16:22,782 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-11-09 01:16:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:22,787 INFO L225 Difference]: With dead ends: 74 [2024-11-09 01:16:22,787 INFO L226 Difference]: Without dead ends: 36 [2024-11-09 01:16:22,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 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-11-09 01:16:22,791 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:22,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 01:16:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-09 01:16:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-09 01:16:22,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 01:16:22,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-09 01:16:22,826 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 58 [2024-11-09 01:16:22,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:22,827 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-09 01:16:22,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-09 01:16:22,828 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-09 01:16:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 01:16:22,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:22,831 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-09 01:16:22,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 01:16:23,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 01:16:23,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 01:16:23,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash -402914689, now seen corresponding path program 1 times [2024-11-09 01:16:23,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 01:16:23,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239327047] [2024-11-09 01:16:23,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:23,035 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-11-09 01:16:23,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 01:16:23,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 01:16:23,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 01:16:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:23,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 01:16:23,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:42,001 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:16:49,667 WARN L286 SmtUtils]: Spent 7.67s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:16:55,469 WARN L286 SmtUtils]: Spent 5.80s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:17:03,474 WARN L286 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:17:10,516 WARN L286 SmtUtils]: Spent 7.04s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:17:18,583 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:17:26,654 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:17:34,729 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 01:17:38,751 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv0 8) c_~var_1_9~0) (= c_~var_1_1~0 (fp.sub c_currentRoundingMode c_~var_1_3~0 c_~var_1_4~0)) (fp.leq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854765600.0))) (fp.geq c_~var_1_3~0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (= c_~var_1_3~0 c_~var_1_5~0) (= c_~var_1_13~0 (_ bv5 16)) (fp.eq (fp.add c_currentRoundingMode c_~var_1_3~0 (fp.add c_currentRoundingMode c_~var_1_4~0 c_~var_1_1~0)) c_~var_1_1~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv0 8) c_~var_1_2~0)) is different from false