./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_dependencies_file-95.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_dependencies_file-95.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 c16393ab70bcd8b9e862c4e4d30225d1c03eae452cc486af13593b1e6eb23940 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:15:18,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:15:18,913 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:15:18,917 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:15:18,918 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:15:18,938 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:15:18,939 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:15:18,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:15:18,940 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:15:18,940 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:15:18,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:15:18,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:15:18,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:15:18,942 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:15:18,942 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:15:18,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:15:18,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:15:18,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:15:18,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:15:18,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:15:18,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:15:18,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:15:18,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:15:18,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:15:18,949 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:15:18,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:15:18,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:15:18,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:15:18,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:15:18,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:15:18,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:15:18,952 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:15:18,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:15:18,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:15:18,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:15:18,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:15:18,954 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:15:18,954 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:15:18,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:15:18,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:15:18,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:15:18,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:15:18,955 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 -> c16393ab70bcd8b9e862c4e4d30225d1c03eae452cc486af13593b1e6eb23940 [2024-10-11 07:15:19,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:15:19,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:15:19,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:15:19,263 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:15:19,263 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:15:19,265 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-95.i [2024-10-11 07:15:20,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:15:20,958 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:15:20,959 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-95.i [2024-10-11 07:15:20,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d0ca70e4/efce6d8aa2e54157a0f0f0048a1e6d86/FLAGf609b2009 [2024-10-11 07:15:20,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d0ca70e4/efce6d8aa2e54157a0f0f0048a1e6d86 [2024-10-11 07:15:20,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:15:20,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:15:20,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:15:20,993 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:15:20,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:15:20,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:15:20" (1/1) ... [2024-10-11 07:15:20,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b4831f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:20, skipping insertion in model container [2024-10-11 07:15:20,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:15:20" (1/1) ... [2024-10-11 07:15:21,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:15:21,197 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_dependencies_file-95.i[919,932] [2024-10-11 07:15:21,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:15:21,261 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:15:21,276 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_dependencies_file-95.i[919,932] [2024-10-11 07:15:21,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:15:21,320 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:15:21,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21 WrapperNode [2024-10-11 07:15:21,321 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:15:21,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:15:21,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:15:21,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:15:21,331 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:15:21" (1/1) ... [2024-10-11 07:15:21,342 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:15:21" (1/1) ... [2024-10-11 07:15:21,379 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-11 07:15:21,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:15:21,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:15:21,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:15:21,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:15:21,399 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,404 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,428 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:15:21,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:15:21,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:15:21,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:15:21,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:15:21,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (1/1) ... [2024-10-11 07:15:21,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:15:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:15:21,499 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:15:21,505 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:15:21,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:15:21,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:15:21,556 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:15:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:15:21,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:15:21,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:15:21,641 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:15:21,643 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:15:21,979 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 07:15:21,979 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:15:22,010 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:15:22,010 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:15:22,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:15:22 BoogieIcfgContainer [2024-10-11 07:15:22,011 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:15:22,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:15:22,013 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:15:22,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:15:22,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:15:20" (1/3) ... [2024-10-11 07:15:22,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66949598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:15:22, skipping insertion in model container [2024-10-11 07:15:22,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:15:21" (2/3) ... [2024-10-11 07:15:22,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66949598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:15:22, skipping insertion in model container [2024-10-11 07:15:22,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:15:22" (3/3) ... [2024-10-11 07:15:22,019 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-95.i [2024-10-11 07:15:22,040 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:15:22,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:15:22,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:15:22,104 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;@62788250, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:15:22,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:15:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.55) internal successors, (62), 41 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:15:22,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 07:15:22,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:22,125 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:22,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:22,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:22,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1805390234, now seen corresponding path program 1 times [2024-10-11 07:15:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:22,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867718095] [2024-10-11 07:15:22,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:22,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:15:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:15:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:15:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:15:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:15:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:15:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:15:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:15:22,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:15:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:15:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:15:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:15:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:15:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:15:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:15:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:22,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:15:22,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:15:22,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867718095] [2024-10-11 07:15:22,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867718095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:15:22,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:15:22,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:15:22,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486628668] [2024-10-11 07:15:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:15:22,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:15:22,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:15:22,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:15:22,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:15:22,551 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.55) internal successors, (62), 41 states have internal predecessors, (62), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:15:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:15:22,596 INFO L93 Difference]: Finished difference Result 112 states and 195 transitions. [2024-10-11 07:15:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:15:22,598 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-10-11 07:15:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:15:22,609 INFO L225 Difference]: With dead ends: 112 [2024-10-11 07:15:22,610 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 07:15:22,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:15:22,620 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:15:22,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:15:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 07:15:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 07:15:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:15:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 84 transitions. [2024-10-11 07:15:22,672 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 84 transitions. Word has length 99 [2024-10-11 07:15:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:15:22,673 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 84 transitions. [2024-10-11 07:15:22,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:15:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 84 transitions. [2024-10-11 07:15:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 07:15:22,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:22,679 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:22,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:15:22,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:22,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2127691808, now seen corresponding path program 1 times [2024-10-11 07:15:22,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798834493] [2024-10-11 07:15:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:22,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:15:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 07:15:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 07:15:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 07:15:54,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 07:15:54,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 07:15:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 07:15:54,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 07:15:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 07:15:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 07:15:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 07:15:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 07:15:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 07:15:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:15:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:15:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:15:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:15:54,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:15:54,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798834493] [2024-10-11 07:15:54,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798834493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:15:54,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:15:54,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:15:54,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863378089] [2024-10-11 07:15:54,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:15:54,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:15:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:15:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:15:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:15:54,080 INFO L87 Difference]: Start difference. First operand 55 states and 84 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:15:54,469 INFO L93 Difference]: Finished difference Result 181 states and 260 transitions. [2024-10-11 07:15:54,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:15:54,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-10-11 07:15:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:15:54,474 INFO L225 Difference]: With dead ends: 181 [2024-10-11 07:15:54,474 INFO L226 Difference]: Without dead ends: 127 [2024-10-11 07:15:54,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:15:54,476 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 116 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:15:54,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 312 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:15:54,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-11 07:15:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 83. [2024-10-11 07:15:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 17 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2024-10-11 07:15:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 124 transitions. [2024-10-11 07:15:54,510 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 124 transitions. Word has length 99 [2024-10-11 07:15:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:15:54,510 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 124 transitions. [2024-10-11 07:15:54,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:15:54,511 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 124 transitions. [2024-10-11 07:15:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 07:15:54,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:15:54,512 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:54,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:15:54,513 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:15:54,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:15:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash -392268126, now seen corresponding path program 1 times [2024-10-11 07:15:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:15:54,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888802722] [2024-10-11 07:15:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:15:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:15:54,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1711647563] [2024-10-11 07:15:54,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:15:54,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:15:54,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:15:54,618 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:15:54,619 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:15:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:15:54,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:15:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:15:54,986 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:15:54,987 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:15:54,989 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:15:55,010 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:15:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:15:55,201 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:15:55,301 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:15:55,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:15:55 BoogieIcfgContainer [2024-10-11 07:15:55,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:15:55,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:15:55,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:15:55,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:15:55,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:15:22" (3/4) ... [2024-10-11 07:15:55,310 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:15:55,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:15:55,312 INFO L158 Benchmark]: Toolchain (without parser) took 34320.14ms. Allocated memory was 148.9MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 96.2MB in the beginning and 672.8MB in the end (delta: -576.6MB). Peak memory consumption was 312.7MB. Max. memory is 16.1GB. [2024-10-11 07:15:55,312 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 148.9MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:15:55,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.78ms. Allocated memory is still 148.9MB. Free memory was 95.8MB in the beginning and 81.0MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:15:55,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.42ms. Allocated memory is still 148.9MB. Free memory was 81.0MB in the beginning and 77.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:15:55,315 INFO L158 Benchmark]: Boogie Preprocessor took 67.99ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 72.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:15:55,316 INFO L158 Benchmark]: RCFGBuilder took 561.16ms. Allocated memory is still 148.9MB. Free memory was 72.8MB in the beginning and 108.4MB in the end (delta: -35.7MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2024-10-11 07:15:55,317 INFO L158 Benchmark]: TraceAbstraction took 33292.47ms. Allocated memory was 148.9MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 107.7MB in the beginning and 672.8MB in the end (delta: -565.1MB). Peak memory consumption was 321.6MB. Max. memory is 16.1GB. [2024-10-11 07:15:55,317 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 1.0GB. Free memory is still 672.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:15:55,319 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.17ms. Allocated memory is still 148.9MB. Free memory is still 110.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.78ms. Allocated memory is still 148.9MB. Free memory was 95.8MB in the beginning and 81.0MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.42ms. Allocated memory is still 148.9MB. Free memory was 81.0MB in the beginning and 77.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.99ms. Allocated memory is still 148.9MB. Free memory was 77.3MB in the beginning and 72.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 561.16ms. Allocated memory is still 148.9MB. Free memory was 72.8MB in the beginning and 108.4MB in the end (delta: -35.7MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33292.47ms. Allocated memory was 148.9MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 107.7MB in the beginning and 672.8MB in the end (delta: -565.1MB). Peak memory consumption was 321.6MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 1.0GB. Free memory is still 672.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryFLOATComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] double var_1_2 = 32.25; [L24] double var_1_3 = 16.5; [L25] unsigned char var_1_4 = 10; [L26] unsigned char var_1_5 = 100; [L27] unsigned char var_1_6 = 1; [L28] signed char var_1_7 = -5; [L29] unsigned char var_1_8 = 0; [L30] signed char var_1_9 = -10; [L31] signed short int var_1_10 = 64; [L32] unsigned short int var_1_11 = 0; [L33] float var_1_12 = 64.75; [L34] double var_1_13 = 5.4; [L35] float var_1_14 = 5.625; [L36] unsigned long int var_1_15 = 32; [L37] unsigned short int last_1_var_1_11 = 0; [L38] float last_1_var_1_12 = 64.75; [L39] unsigned long int last_1_var_1_15 = 32; [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L109] last_1_var_1_11 = var_1_11 [L110] last_1_var_1_12 = var_1_12 [L111] last_1_var_1_15 = var_1_15 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L84] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_3=33/2, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L85] var_1_3 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L86] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=10, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L87] var_1_4 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L88] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L89] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L89] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=100, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L90] var_1_5 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_5 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L91] RET assume_abort_if_not(var_1_5 >= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L92] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L92] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=1, var_1_7=-5, var_1_8=0, var_1_9=-10] [L93] var_1_6 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L94] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_7=-5, var_1_8=0, var_1_9=-10] [L95] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L95] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=0, var_1_9=-10] [L96] var_1_8 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L97] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_9=-10] [L98] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-10] [L98] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-10] [L99] var_1_9 = __VERIFIER_nondet_char() [L100] CALL assume_abort_if_not(var_1_9 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L100] RET assume_abort_if_not(var_1_9 >= -63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L101] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L101] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_13=27/5, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L102] var_1_13 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L103] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L104] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L104] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_14=45/8, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L105] var_1_14 = __VERIFIER_nondet_float() [L106] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L106] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L122] RET updateVariables() [L123] CALL step() [L43] EXPR last_1_var_1_11 ^ last_1_var_1_15 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L43] COND FALSE !((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) [L48] COND FALSE !((var_1_5 <= var_1_4) && var_1_8) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=-5, var_1_8=-255, var_1_9=-63] [L55] COND TRUE (-8 * var_1_11) < var_1_4 [L56] var_1_7 = 1 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=32, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L61] COND TRUE 128 >= last_1_var_1_15 [L62] var_1_15 = (var_1_6 + (var_1_4 + var_1_11)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L66] COND FALSE !(var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L69] COND FALSE !((10.8 + var_1_12) <= (- var_1_12)) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=64, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L72] COND FALSE !(-4 >= var_1_4) [L79] var_1_10 = var_1_4 VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L114-L115] return (((((((10.8 + var_1_12) <= (- var_1_12)) ? (var_1_1 == ((unsigned char) (((((1) < (var_1_4)) ? (1) : (var_1_4))) + (var_1_5 - var_1_6)))) : 1) && (((var_1_5 <= var_1_4) && var_1_8) ? (var_1_8 ? (var_1_7 == ((signed char) (var_1_6 + ((((5) < (var_1_9)) ? (5) : (var_1_9)))))) : (var_1_7 == ((signed char) ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9)))))) : (((-8 * var_1_11) < var_1_4) ? (var_1_7 == ((signed char) 1)) : (var_1_7 == ((signed char) var_1_9))))) && ((-4 >= var_1_4) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((signed short int) (var_1_7 + var_1_6))) : (var_1_10 == ((signed short int) var_1_5))) : (var_1_10 == ((signed short int) var_1_4)))) && (((var_1_6 - last_1_var_1_15) < ((last_1_var_1_11 ^ last_1_var_1_15) / ((((-8) > (var_1_5)) ? (-8) : (var_1_5))))) ? ((last_1_var_1_12 == last_1_var_1_12) ? (var_1_11 == ((unsigned short int) last_1_var_1_15)) : 1) : 1)) && ((var_1_2 != (var_1_3 / ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))))) ? (var_1_12 == ((float) var_1_14)) : 1)) && ((128 >= last_1_var_1_15) ? (var_1_15 == ((unsigned long int) (var_1_6 + (var_1_4 + var_1_11)))) : (var_1_15 == ((unsigned long int) var_1_7))) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=0, last_1_var_1_12=259/4, last_1_var_1_15=32, var_1_10=1, var_1_11=0, var_1_12=259/4, var_1_15=64, var_1_1=32, var_1_4=1, var_1_5=95, var_1_6=63, var_1_7=1, var_1_8=-255, var_1_9=-63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.1s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 116 mSDsluCounter, 393 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 218 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 175 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=2, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 44 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 31.4s InterpolantComputationTime, 396 NumberOfCodeBlocks, 396 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 196 ConstructedInterpolants, 0 QuantifiedInterpolants, 857 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 840/840 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:15:55,350 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_dependencies_file-95.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 c16393ab70bcd8b9e862c4e4d30225d1c03eae452cc486af13593b1e6eb23940 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:15:57,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:15:57,811 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:15:57,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:15:57,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:15:57,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:15:57,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:15:57,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:15:57,870 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:15:57,871 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:15:57,871 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:15:57,871 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:15:57,872 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:15:57,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:15:57,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:15:57,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:15:57,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:15:57,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:15:57,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:15:57,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:15:57,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:15:57,878 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:15:57,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:15:57,880 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:15:57,881 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:15:57,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:15:57,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:15:57,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:15:57,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:15:57,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:15:57,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:15:57,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:15:57,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:15:57,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:15:57,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:15:57,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:15:57,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:15:57,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:15:57,885 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:15:57,885 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:15:57,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:15:57,886 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:15:57,886 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:15:57,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:15:57,887 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:15:57,887 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 -> c16393ab70bcd8b9e862c4e4d30225d1c03eae452cc486af13593b1e6eb23940 [2024-10-11 07:15:58,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:15:58,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:15:58,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:15:58,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:15:58,276 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:15:58,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-95.i [2024-10-11 07:15:59,859 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:16:00,106 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:16:00,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-95.i [2024-10-11 07:16:00,125 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/998a834ff/70059636fcd8498bb46dadfa7b86a31d/FLAGd6ae3d2cb [2024-10-11 07:16:00,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/998a834ff/70059636fcd8498bb46dadfa7b86a31d [2024-10-11 07:16:00,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:16:00,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:16:00,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:16:00,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:16:00,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:16:00,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336b8f0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00, skipping insertion in model container [2024-10-11 07:16:00,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,189 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:16:00,385 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_dependencies_file-95.i[919,932] [2024-10-11 07:16:00,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:16:00,483 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:16:00,495 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_dependencies_file-95.i[919,932] [2024-10-11 07:16:00,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:16:00,539 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:16:00,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00 WrapperNode [2024-10-11 07:16:00,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:16:00,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:16:00,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:16:00,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:16:00,549 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:16:00" (1/1) ... [2024-10-11 07:16:00,560 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:16:00" (1/1) ... [2024-10-11 07:16:00,586 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 119 [2024-10-11 07:16:00,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:16:00,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:16:00,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:16:00,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:16:00,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,602 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,624 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:16:00,625 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,625 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,658 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:16:00,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:16:00,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:16:00,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:16:00,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (1/1) ... [2024-10-11 07:16:00,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:16:00,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:16:00,706 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:16:00,711 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:16:00,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:16:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:16:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:16:00,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:16:00,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:16:00,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:16:00,836 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:16:00,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:16:08,728 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:16:08,728 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:16:08,799 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:16:08,799 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:16:08,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:08 BoogieIcfgContainer [2024-10-11 07:16:08,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:16:08,810 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:16:08,810 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:16:08,814 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:16:08,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:16:00" (1/3) ... [2024-10-11 07:16:08,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2d126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:16:08, skipping insertion in model container [2024-10-11 07:16:08,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:16:00" (2/3) ... [2024-10-11 07:16:08,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f2d126d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:16:08, skipping insertion in model container [2024-10-11 07:16:08,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:16:08" (3/3) ... [2024-10-11 07:16:08,818 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-95.i [2024-10-11 07:16:08,838 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:16:08,839 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:16:08,904 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:16:08,911 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;@53f8af1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:16:08,912 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:16:08,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:16:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:16:08,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:08,934 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:08,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:08,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:08,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1425552003, now seen corresponding path program 1 times [2024-10-11 07:16:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:16:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427694227] [2024-10-11 07:16:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:08,962 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:16:08,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:16:08,965 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:16:08,967 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:16:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:09,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:16:09,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-11 07:16:10,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:16:10,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:16:10,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427694227] [2024-10-11 07:16:10,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427694227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:16:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:16:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:16:10,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118594382] [2024-10-11 07:16:10,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:16:10,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:16:10,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:16:10,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:16:10,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:16:10,090 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:16:14,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:16:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:16:14,396 INFO L93 Difference]: Finished difference Result 90 states and 159 transitions. [2024-10-11 07:16:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:16:14,494 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 96 [2024-10-11 07:16:14,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:16:14,501 INFO L225 Difference]: With dead ends: 90 [2024-10-11 07:16:14,501 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 07:16:14,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:16:14,508 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:16:14,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 07:16:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 07:16:14,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-11 07:16:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 07:16:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2024-10-11 07:16:14,559 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 96 [2024-10-11 07:16:14,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:16:14,560 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2024-10-11 07:16:14,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-11 07:16:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2024-10-11 07:16:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 07:16:14,564 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:16:14,565 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:14,596 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:16:14,765 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:16:14,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:16:14,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:16:14,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1125236291, now seen corresponding path program 1 times [2024-10-11 07:16:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:16:14,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [159062623] [2024-10-11 07:16:14,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:16:14,769 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:16:14,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:16:14,772 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:16:14,775 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:16:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:16:15,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 07:16:15,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:16:20,376 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-11 07:16:20,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:16:20,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:16:20,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [159062623] [2024-10-11 07:16:20,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [159062623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:16:20,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:16:20,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:16:20,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235217674] [2024-10-11 07:16:20,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:16:20,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:16:20,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:16:20,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:16:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:16:20,380 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-11 07:16:24,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:16:28,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:16:32,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:16:38,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:16:42,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:16:46,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []