./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_codestructure_normal_file-42.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_codestructure_normal_file-42.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 b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:21:09,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:21:10,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:21:10,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:21:10,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:21:10,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:21:10,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:21:10,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:21:10,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:21:10,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:21:10,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:21:10,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:21:10,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:21:10,069 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:21:10,069 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:21:10,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:21:10,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:21:10,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:21:10,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:21:10,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:21:10,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:21:10,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:21:10,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:21:10,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:21:10,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:21:10,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:21:10,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:21:10,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:21:10,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:21:10,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:21:10,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:21:10,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:21:10,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:10,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:21:10,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:21:10,080 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:21:10,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:21:10,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:21:10,081 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:21:10,081 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:21:10,081 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:21:10,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:21:10,081 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 -> b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 [2024-10-11 07:21:10,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:21:10,306 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:21:10,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:21:10,311 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:21:10,311 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:21:10,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2024-10-11 07:21:11,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:21:11,916 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:21:11,917 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2024-10-11 07:21:11,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b1200493/ecf48174688e4d6fa76502e885d9fe95/FLAGaeed23e94 [2024-10-11 07:21:11,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8b1200493/ecf48174688e4d6fa76502e885d9fe95 [2024-10-11 07:21:11,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:21:11,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:21:11,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:11,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:21:11,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:21:11,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:11" (1/1) ... [2024-10-11 07:21:11,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cea0d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:11, skipping insertion in model container [2024-10-11 07:21:11,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:11" (1/1) ... [2024-10-11 07:21:11,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:21:12,114 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_codestructure_normal_file-42.i[913,926] [2024-10-11 07:21:12,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:12,189 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:21:12,200 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_codestructure_normal_file-42.i[913,926] [2024-10-11 07:21:12,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:12,251 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:21:12,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12 WrapperNode [2024-10-11 07:21:12,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:12,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:12,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:21:12,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:21:12,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,309 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 144 [2024-10-11 07:21:12,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:12,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:21:12,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:21:12,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:21:12,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,323 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,345 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 07:21:12,345 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,345 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,352 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,354 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:21:12,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:21:12,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:21:12,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:21:12,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (1/1) ... [2024-10-11 07:21:12,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:12,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:12,395 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 07:21:12,397 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 07:21:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:21:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:21:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:21:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:21:12,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:21:12,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:21:12,505 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:21:12,506 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:21:12,777 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:21:12,778 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:21:12,839 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:21:12,842 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:21:12,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:12 BoogieIcfgContainer [2024-10-11 07:21:12,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:21:12,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:21:12,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:21:12,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:21:12,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:11" (1/3) ... [2024-10-11 07:21:12,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25535627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:12, skipping insertion in model container [2024-10-11 07:21:12,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:12" (2/3) ... [2024-10-11 07:21:12,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25535627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:12, skipping insertion in model container [2024-10-11 07:21:12,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:12" (3/3) ... [2024-10-11 07:21:12,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-42.i [2024-10-11 07:21:12,865 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:21:12,866 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:21:12,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:21:12,924 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;@518944a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:21:12,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:21:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:21:12,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 07:21:12,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:12,945 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:12,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:12,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:12,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1563230169, now seen corresponding path program 1 times [2024-10-11 07:21:12,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:21:12,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734865754] [2024-10-11 07:21:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:21:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:21:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:21:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:21:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:21:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:21:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:21:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:21:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:21:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:21:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:21:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:21:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:21:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:21:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:21:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:21:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:21:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:21:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:21:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:21:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:21:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:21:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:21:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:21:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 07:21:13,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:21:13,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734865754] [2024-10-11 07:21:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734865754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:21:13,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:21:13,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:21:13,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702505653] [2024-10-11 07:21:13,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:21:13,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:21:13,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:21:13,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:21:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:21:13,707 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 07:21:13,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:13,783 INFO L93 Difference]: Finished difference Result 131 states and 238 transitions. [2024-10-11 07:21:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:21:13,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-10-11 07:21:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:13,792 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:21:13,792 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 07:21:13,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:21:13,796 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 19 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:13,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 163 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:21:13,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 07:21:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2024-10-11 07:21:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:21:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 100 transitions. [2024-10-11 07:21:13,831 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 100 transitions. Word has length 140 [2024-10-11 07:21:13,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:13,833 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 100 transitions. [2024-10-11 07:21:13,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 07:21:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2024-10-11 07:21:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 07:21:13,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:13,836 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:13,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:21:13,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:13,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:13,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1855172130, now seen corresponding path program 1 times [2024-10-11 07:21:13,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:21:13,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29984874] [2024-10-11 07:21:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:13,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:21:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:21:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1976904228] [2024-10-11 07:21:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:21:13,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:13,995 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 07:21:14,002 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 07:21:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:21:14,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:21:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:21:14,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:21:14,381 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:21:14,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:21:14,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:21:14,584 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 07:21:14,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 07:21:14,673 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:21:14,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:21:14 BoogieIcfgContainer [2024-10-11 07:21:14,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:21:14,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:21:14,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:21:14,676 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:21:14,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:12" (3/4) ... [2024-10-11 07:21:14,678 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:21:14,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:21:14,679 INFO L158 Benchmark]: Toolchain (without parser) took 2738.31ms. Allocated memory is still 211.8MB. Free memory was 138.2MB in the beginning and 94.5MB in the end (delta: 43.7MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2024-10-11 07:21:14,679 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:21:14,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.42ms. Allocated memory is still 211.8MB. Free memory was 138.2MB in the beginning and 122.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:21:14,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.53ms. Allocated memory is still 211.8MB. Free memory was 122.9MB in the beginning and 120.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:21:14,680 INFO L158 Benchmark]: Boogie Preprocessor took 49.10ms. Allocated memory is still 211.8MB. Free memory was 120.0MB in the beginning and 115.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:21:14,681 INFO L158 Benchmark]: RCFGBuilder took 482.88ms. Allocated memory is still 211.8MB. Free memory was 115.1MB in the beginning and 89.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 07:21:14,681 INFO L158 Benchmark]: TraceAbstraction took 1830.93ms. Allocated memory is still 211.8MB. Free memory was 88.7MB in the beginning and 94.5MB in the end (delta: -5.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:21:14,681 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 211.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:21:14,683 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.14ms. Allocated memory is still 136.3MB. Free memory is still 100.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.42ms. Allocated memory is still 211.8MB. Free memory was 138.2MB in the beginning and 122.9MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.53ms. Allocated memory is still 211.8MB. Free memory was 122.9MB in the beginning and 120.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.10ms. Allocated memory is still 211.8MB. Free memory was 120.0MB in the beginning and 115.1MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 482.88ms. Allocated memory is still 211.8MB. Free memory was 115.1MB in the beginning and 89.4MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1830.93ms. Allocated memory is still 211.8MB. Free memory was 88.7MB in the beginning and 94.5MB in the end (delta: -5.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 211.8MB. Free memory is still 94.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someUnaryDOUBLEoperation at line 35, overapproximation of someBinaryArithmeticFLOAToperation at line 75. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_3 = -200; [L25] signed short int var_1_4 = 2; [L26] signed char var_1_5 = -8; [L27] unsigned char var_1_6 = 10; [L28] unsigned char var_1_7 = 128; [L29] unsigned char var_1_8 = 1; [L30] float var_1_9 = 9999999999.5; [L31] unsigned char var_1_10 = 1; [L32] unsigned char var_1_11 = 0; [L33] unsigned char var_1_12 = 0; [L34] signed short int var_1_13 = 200; [L35] float var_1_14 = -0.8; [L36] float var_1_15 = 127.25; [L37] float var_1_16 = 3.5; [L38] unsigned short int var_1_17 = 16; [L39] unsigned short int var_1_18 = 100; [L40] unsigned char var_1_19 = 1; [L41] unsigned char var_1_20 = 0; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] FCALL updateLastVariables() [L138] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-200, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L93] var_1_3 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_3 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L94] RET assume_abort_if_not(var_1_3 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L95] CALL assume_abort_if_not(var_1_3 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L95] RET assume_abort_if_not(var_1_3 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=2, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L96] var_1_4 = __VERIFIER_nondet_short() [L97] CALL assume_abort_if_not(var_1_4 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L97] RET assume_abort_if_not(var_1_4 >= -32767) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L98] CALL assume_abort_if_not(var_1_4 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L98] RET assume_abort_if_not(var_1_4 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=-8, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L99] var_1_5 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L100] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L101] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L101] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=128, var_1_8=1, var_1_9=19999999999/2] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1, var_1_9=19999999999/2] [L103] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1, var_1_9=19999999999/2] [L104] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1, var_1_9=19999999999/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1, var_1_9=19999999999/2] [L104] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1, var_1_9=19999999999/2] [L105] var_1_9 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L106] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L107] var_1_10 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L108] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L109] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L109] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L110] var_1_11 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L111] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L112] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L112] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L113] var_1_12 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L114] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L115] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L116] var_1_15 = __VERIFIER_nondet_float() [L117] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L117] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L118] var_1_16 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L119] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=100, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L120] var_1_18 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L121] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L122] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L122] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L123] var_1_20 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L124] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L125] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L125] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=16, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L138] RET updateVariables() [L139] CALL step() [L45] COND TRUE \read(var_1_2) [L46] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=10, var_1_7=127, var_1_8=1] [L52] COND TRUE var_1_5 >= -2 [L53] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=1] [L55] COND FALSE !((49.5f <= var_1_9) && (var_1_2 && var_1_10)) [L62] var_1_8 = var_1_12 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L64] COND FALSE !(var_1_6 >= (var_1_1 / var_1_7)) [L71] var_1_13 = var_1_3 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L73] COND TRUE (((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || var_1_2 VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L74] COND TRUE var_1_13 <= var_1_3 [L75] var_1_14 = (var_1_15 + var_1_16) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=16, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L82] COND TRUE var_1_4 > var_1_3 [L83] var_1_17 = ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=32794, var_1_18=-32769, var_1_19=1, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L85] COND TRUE var_1_9 <= var_1_15 [L86] var_1_19 = (var_1_12 || var_1_20) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=32794, var_1_18=-32769, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L139] RET step() [L140] CALL, EXPR property() [L130-L131] return ((((((var_1_2 ? (var_1_1 == ((signed short int) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_3) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_9) && (var_1_2 && var_1_10)) ? ((var_1_1 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_2 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((var_1_6 >= (var_1_1 / var_1_7)) ? ((var_1_1 != ((((((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) > (var_1_5)) ? (((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) var_1_6))) : (var_1_13 == ((signed short int) var_1_3)))) && (((((((var_1_13) < (8)) ? (var_1_13) : (8))) <= var_1_5) || var_1_2) ? ((var_1_13 <= var_1_3) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_4 > var_1_3) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_6 + var_1_18))) ? (25) : ((var_1_6 + var_1_18)))))) : 1)) && ((var_1_9 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=32794, var_1_18=-32769, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=-32767, var_1_17=32794, var_1_18=-32769, var_1_19=0, var_1_1=3557, var_1_20=0, var_1_2=1, var_1_3=-32767, var_1_4=3557, var_1_5=127, var_1_6=27, var_1_7=127, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 163 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 84 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=1, InterpolantAutomatonStates: 3, 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, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 422 NumberOfCodeBlocks, 422 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 167 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1012/1012 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 07:21:14,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_normal_file-42.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 b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:21:16,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:21:16,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:21:16,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:21:16,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:21:16,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:21:16,974 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:21:16,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:21:16,975 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:21:16,976 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:21:16,977 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:21:16,977 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:21:16,977 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:21:16,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:21:16,980 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:21:16,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:21:16,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:21:16,981 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:21:16,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:21:16,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:21:16,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:21:16,982 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:21:16,982 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:21:16,982 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:21:16,982 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:21:16,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:21:16,983 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:21:16,983 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:21:16,983 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:21:16,983 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:21:16,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:21:16,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:21:16,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:21:16,984 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:21:16,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:16,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:21:16,984 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:21:16,984 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:21:16,984 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:21:16,985 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:21:16,985 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:21:16,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:21:16,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:21:16,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:21:16,988 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:21:16,988 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 -> b9a474490b26b75e32bf600e29c6590e80c0b8d4fd291d4937993f7ea2b0bba8 [2024-10-11 07:21:17,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:21:17,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:21:17,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:21:17,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:21:17,342 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:21:17,344 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2024-10-11 07:21:18,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:21:19,018 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:21:19,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-42.i [2024-10-11 07:21:19,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f9fbdb007/d2d9370c214b43598a84172fd3fb9ecb/FLAG392f90212 [2024-10-11 07:21:19,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f9fbdb007/d2d9370c214b43598a84172fd3fb9ecb [2024-10-11 07:21:19,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:21:19,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:21:19,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:19,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:21:19,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:21:19,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af9c950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19, skipping insertion in model container [2024-10-11 07:21:19,054 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,080 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:21:19,229 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_codestructure_normal_file-42.i[913,926] [2024-10-11 07:21:19,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:19,306 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:21:19,316 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_codestructure_normal_file-42.i[913,926] [2024-10-11 07:21:19,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:21:19,366 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:21:19,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19 WrapperNode [2024-10-11 07:21:19,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:21:19,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:19,368 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:21:19,368 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:21:19,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,417 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-11 07:21:19,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:21:19,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:21:19,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:21:19,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:21:19,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,450 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 07:21:19,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:21:19,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:21:19,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:21:19,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:21:19,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (1/1) ... [2024-10-11 07:21:19,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:21:19,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:21:19,507 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 07:21:19,511 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 07:21:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:21:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:21:19,545 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:21:19,546 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:21:19,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:21:19,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:21:19,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:21:19,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:21:19,965 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:21:19,965 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:21:20,003 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:21:20,004 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:21:20,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:20 BoogieIcfgContainer [2024-10-11 07:21:20,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:21:20,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:21:20,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:21:20,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:21:20,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:21:19" (1/3) ... [2024-10-11 07:21:20,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6b009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:20, skipping insertion in model container [2024-10-11 07:21:20,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:21:19" (2/3) ... [2024-10-11 07:21:20,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f6b009 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:21:20, skipping insertion in model container [2024-10-11 07:21:20,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:21:20" (3/3) ... [2024-10-11 07:21:20,010 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-42.i [2024-10-11 07:21:20,023 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:21:20,024 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:21:20,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:21:20,091 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;@391650e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:21:20,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:21:20,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:21:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 07:21:20,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:20,109 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:20,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:20,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:20,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1563230169, now seen corresponding path program 1 times [2024-10-11 07:21:20,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:21:20,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114892992] [2024-10-11 07:21:20,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:20,129 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 07:21:20,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:21:20,139 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 07:21:20,144 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 07:21:20,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:20,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:21:20,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:20,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 07:21:20,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:21:20,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:21:20,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114892992] [2024-10-11 07:21:20,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114892992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:21:20,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:21:20,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:21:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799423064] [2024-10-11 07:21:20,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:21:20,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:21:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:21:20,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:21:20,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:21:20,529 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 07:21:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:21:20,692 INFO L93 Difference]: Finished difference Result 131 states and 238 transitions. [2024-10-11 07:21:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:21:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-10-11 07:21:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:21:20,707 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:21:20,707 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 07:21:20,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:21:20,715 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:21:20,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 162 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:21:20,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 07:21:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2024-10-11 07:21:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 07:21:20,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 100 transitions. [2024-10-11 07:21:20,772 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 100 transitions. Word has length 140 [2024-10-11 07:21:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:21:20,776 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 100 transitions. [2024-10-11 07:21:20,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 07:21:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2024-10-11 07:21:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 07:21:20,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:21:20,780 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:20,789 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 07:21:20,981 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 07:21:20,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:21:20,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:21:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1855172130, now seen corresponding path program 1 times [2024-10-11 07:21:20,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:21:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078672525] [2024-10-11 07:21:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:21:20,983 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 07:21:20,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:21:20,987 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 07:21:20,989 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 07:21:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:21:21,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 07:21:21,181 INFO L278 TraceCheckSpWp]: Computing forward predicates...