./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_operatoramount_amount25_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:49:16,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:49:16,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 07:49:16,931 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:49:16,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:49:16,951 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:49:16,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:49:16,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:49:16,952 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:49:16,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:49:16,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:49:16,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:49:16,956 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:49:16,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:49:16,959 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:49:16,959 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:49:16,960 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:49:16,960 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:49:16,960 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 07:49:16,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:49:16,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:49:16,961 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:49:16,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:49:16,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:49:16,962 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:49:16,963 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:49:16,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:49:16,963 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:49:16,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:49:16,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:49:16,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:49:16,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:49:16,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:49:16,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:49:16,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:49:16,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:49:16,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 07:49:16,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 07:49:16,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:49:16,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:49:16,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:49:16,971 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:49:16,971 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 [2024-11-20 07:49:17,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:49:17,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:49:17,224 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:49:17,225 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:49:17,226 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:49:17,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-20 07:49:18,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:49:18,994 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:49:18,995 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-20 07:49:19,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659bdb982/87d2e3cabe5d475b9c2347a162f7fe5f/FLAG11232fb23 [2024-11-20 07:49:19,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659bdb982/87d2e3cabe5d475b9c2347a162f7fe5f [2024-11-20 07:49:19,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:49:19,020 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:49:19,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:49:19,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:49:19,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:49:19,028 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,029 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779d00b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19, skipping insertion in model container [2024-11-20 07:49:19,029 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:49:19,237 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2024-11-20 07:49:19,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:49:19,320 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:49:19,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2024-11-20 07:49:19,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:49:19,395 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:49:19,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19 WrapperNode [2024-11-20 07:49:19,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:49:19,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:49:19,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:49:19,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:49:19,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,456 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-20 07:49:19,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:49:19,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:49:19,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:49:19,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:49:19,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,493 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:49:19,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:49:19,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:49:19,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:49:19,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:49:19,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (1/1) ... [2024-11-20 07:49:19,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:49:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:49:19,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:49:19,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:49:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:49:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:49:19,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:49:19,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 07:49:19,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:49:19,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:49:19,692 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:49:19,695 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:49:20,006 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 07:49:20,007 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:49:20,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:49:20,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:49:20,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:20 BoogieIcfgContainer [2024-11-20 07:49:20,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:49:20,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:49:20,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:49:20,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:49:20,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:49:19" (1/3) ... [2024-11-20 07:49:20,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d34a998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:49:20, skipping insertion in model container [2024-11-20 07:49:20,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:19" (2/3) ... [2024-11-20 07:49:20,033 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d34a998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:49:20, skipping insertion in model container [2024-11-20 07:49:20,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:20" (3/3) ... [2024-11-20 07:49:20,035 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2024-11-20 07:49:20,054 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:49:20,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:49:20,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:49:20,143 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;@2fb41141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:49:20,144 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:49:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:49:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:49:20,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:20,164 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:20,164 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:20,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:20,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2023651706, now seen corresponding path program 1 times [2024-11-20 07:49:20,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:49:20,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976975920] [2024-11-20 07:49:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:20,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:49:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:49:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:49:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:49:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:49:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:49:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:49:20,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:49:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:49:20,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:49:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:49:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:49:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:49:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:49:20,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:49:20,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:49:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:49:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:49:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 07:49:20,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:49:20,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976975920] [2024-11-20 07:49:20,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976975920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:49:20,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:49:20,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:49:20,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491225049] [2024-11-20 07:49:20,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:49:20,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:49:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:49:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:49:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:49:20,600 INFO L87 Difference]: Start difference. First operand has 62 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 07:49:20,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:49:20,624 INFO L93 Difference]: Finished difference Result 117 states and 193 transitions. [2024-11-20 07:49:20,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:49:20,626 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-11-20 07:49:20,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:49:20,634 INFO L225 Difference]: With dead ends: 117 [2024-11-20 07:49:20,634 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 07:49:20,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:49:20,641 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:49:20,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:49:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 07:49:20,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-20 07:49:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:49:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2024-11-20 07:49:20,688 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 109 [2024-11-20 07:49:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:49:20,689 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2024-11-20 07:49:20,689 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, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 07:49:20,689 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2024-11-20 07:49:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:49:20,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:20,693 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:20,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 07:49:20,694 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:20,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:20,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1837775300, now seen corresponding path program 1 times [2024-11-20 07:49:20,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:49:20,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469639860] [2024-11-20 07:49:20,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:20,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:49:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 07:49:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 07:49:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 07:49:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 07:49:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 07:49:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 07:49:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 07:49:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 07:49:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 07:49:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 07:49:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 07:49:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 07:49:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 07:49:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 07:49:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 07:49:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 07:49:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 07:49:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:21,484 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-20 07:49:21,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 07:49:21,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469639860] [2024-11-20 07:49:21,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469639860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:49:21,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:49:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 07:49:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722087619] [2024-11-20 07:49:21,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:49:21,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 07:49:21,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 07:49:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 07:49:21,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 07:49:21,493 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:49:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:49:22,251 INFO L93 Difference]: Finished difference Result 200 states and 294 transitions. [2024-11-20 07:49:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 07:49:22,253 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-20 07:49:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:49:22,258 INFO L225 Difference]: With dead ends: 200 [2024-11-20 07:49:22,259 INFO L226 Difference]: Without dead ends: 145 [2024-11-20 07:49:22,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 07:49:22,263 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 191 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 07:49:22,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 291 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 07:49:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-20 07:49:22,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 59. [2024-11-20 07:49:22,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.25) internal successors, (50), 40 states have internal predecessors, (50), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:49:22,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 84 transitions. [2024-11-20 07:49:22,289 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 84 transitions. Word has length 109 [2024-11-20 07:49:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:49:22,291 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 84 transitions. [2024-11-20 07:49:22,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:49:22,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 84 transitions. [2024-11-20 07:49:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-20 07:49:22,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:22,295 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:22,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 07:49:22,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:22,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:22,297 INFO L85 PathProgramCache]: Analyzing trace with hash 867786670, now seen corresponding path program 1 times [2024-11-20 07:49:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 07:49:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242086622] [2024-11-20 07:49:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:22,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 07:49:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:49:22,423 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 07:49:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 07:49:22,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 07:49:22,537 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 07:49:22,538 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:49:22,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 07:49:22,544 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-20 07:49:22,637 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:49:22,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:49:22 BoogieIcfgContainer [2024-11-20 07:49:22,640 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:49:22,641 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:49:22,641 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:49:22,641 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:49:22,641 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:20" (3/4) ... [2024-11-20 07:49:22,644 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 07:49:22,645 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:49:22,646 INFO L158 Benchmark]: Toolchain (without parser) took 3625.69ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 72.0MB in the end (delta: 35.9MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2024-11-20 07:49:22,646 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:49:22,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.52ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 135.4MB in the end (delta: -27.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:49:22,647 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.47ms. Allocated memory is still 163.6MB. Free memory was 135.4MB in the beginning and 133.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:49:22,647 INFO L158 Benchmark]: Boogie Preprocessor took 55.26ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 07:49:22,648 INFO L158 Benchmark]: RCFGBuilder took 511.73ms. Allocated memory is still 163.6MB. Free memory was 131.2MB in the beginning and 113.6MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-20 07:49:22,652 INFO L158 Benchmark]: TraceAbstraction took 2613.50ms. Allocated memory is still 163.6MB. Free memory was 112.9MB in the beginning and 72.0MB in the end (delta: 40.8MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2024-11-20 07:49:22,653 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 163.6MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:49:22,655 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory is still 51.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.52ms. Allocated memory is still 163.6MB. Free memory was 107.9MB in the beginning and 135.4MB in the end (delta: -27.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.47ms. Allocated memory is still 163.6MB. Free memory was 135.4MB in the beginning and 133.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.26ms. Allocated memory is still 163.6MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 511.73ms. Allocated memory is still 163.6MB. Free memory was 131.2MB in the beginning and 113.6MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2613.50ms. Allocated memory is still 163.6MB. Free memory was 112.9MB in the beginning and 72.0MB in the end (delta: 40.8MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 163.6MB. Free memory is still 72.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 25; [L23] unsigned long int var_1_6 = 2; [L24] unsigned long int var_1_7 = 2762957886; [L25] unsigned long int var_1_8 = 2; [L26] unsigned long int var_1_9 = 1000000000; [L27] unsigned long int var_1_10 = 100; [L28] signed char var_1_11 = 4; [L29] signed char var_1_12 = 8; [L30] signed char var_1_13 = 10; [L31] signed char var_1_14 = 8; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 32.4; [L35] double var_1_18 = 15.5; [L36] unsigned long int last_1_var_1_6 = 2; VAL [isInitial=0, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L101] isInitial = 1 [L102] FCALL initially() [L103] COND TRUE 1 [L104] CALL updateLastVariables() [L94] last_1_var_1_6 = var_1_6 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=2762957886, var_1_8=2, var_1_9=1000000000] [L104] RET updateLastVariables() [L105] CALL updateVariables() [L66] var_1_7 = __VERIFIER_nondet_ulong() [L67] CALL assume_abort_if_not(var_1_7 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L67] RET assume_abort_if_not(var_1_7 >= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L68] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L68] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2, var_1_9=1000000000] [L69] var_1_8 = __VERIFIER_nondet_ulong() [L70] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_9=1000000000] [L70] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_9=1000000000] [L71] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1000000000] [L71] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647, var_1_9=1000000000] [L72] var_1_9 = __VERIFIER_nondet_ulong() [L73] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L73] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L74] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L74] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=100, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L75] var_1_10 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L76] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L77] CALL assume_abort_if_not(var_1_10 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L77] RET assume_abort_if_not(var_1_10 <= 4294967294) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=8, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L78] var_1_12 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L79] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L80] CALL assume_abort_if_not(var_1_12 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L80] RET assume_abort_if_not(var_1_12 <= 32) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=10, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L81] var_1_13 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L82] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L83] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L83] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L84] var_1_14 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L85] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L86] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L86] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=0, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L88] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L89] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L89] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_18=31/2, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L90] var_1_18 = __VERIFIER_nondet_double() [L91] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L91] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=1, var_1_16=-255, var_1_17=162/5, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L105] RET updateVariables() [L106] CALL step() [L40] var_1_15 = var_1_16 [L41] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=4, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L42] COND TRUE \read(var_1_15) [L43] var_1_11 = (((var_1_12 + var_1_13) + var_1_14) - 50) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=25, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L45] COND TRUE \read(var_1_15) [L46] var_1_1 = (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L48] signed long int stepLocal_2 = (((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)); [L49] signed long int stepLocal_1 = (((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11)); [L50] unsigned long int stepLocal_0 = var_1_7 - var_1_8; VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967296, stepLocal_1=2, stepLocal_2=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2, var_1_7=6442450943, var_1_8=2147483647] [L51] COND FALSE !(last_1_var_1_6 != stepLocal_2) [L62] var_1_6 = var_1_8 VAL [isInitial=1, last_1_var_1_6=2, stepLocal_0=4294967296, stepLocal_1=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L106] RET step() [L107] CALL, EXPR property() [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L97] EXPR (last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L97] EXPR (var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8))) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L97-L98] return ((((var_1_15 ? (var_1_1 == ((signed short int) (((((var_1_11 + var_1_11)) < (var_1_11)) ? ((var_1_11 + var_1_11)) : (var_1_11))))) : 1) && ((last_1_var_1_6 != ((((var_1_11) < (var_1_11)) ? (var_1_11) : (var_1_11)))) ? (((var_1_7 - var_1_8) >= var_1_9) ? ((((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) < (var_1_8 >> var_1_9)) ? (var_1_6 == ((unsigned long int) var_1_8)) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_10))) : (var_1_6 == ((unsigned long int) var_1_8)))) && (var_1_15 ? (var_1_11 == ((signed char) (((var_1_12 + var_1_13) + var_1_14) - 50))) : 1)) && (var_1_15 == ((unsigned char) var_1_16))) && (var_1_17 == ((double) var_1_18)) ; [L107] RET, EXPR property() [L107] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_6=2, var_1_10=4294967294, var_1_11=2, var_1_12=0, var_1_13=0, var_1_14=52, var_1_15=-255, var_1_16=-255, var_1_17=6442450948, var_1_18=6442450948, var_1_1=2, var_1_6=2147483647, var_1_7=6442450943, var_1_8=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 375 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 169 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 110 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 206 mSDtfsCounter, 110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, 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, 86 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 329 NumberOfCodeBlocks, 329 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 1088/1088 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 07:49:22,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 07:49:25,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 07:49:25,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 07:49:25,106 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 07:49:25,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 07:49:25,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 07:49:25,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 07:49:25,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 07:49:25,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 07:49:25,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 07:49:25,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 07:49:25,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 07:49:25,146 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 07:49:25,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 07:49:25,149 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 07:49:25,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 07:49:25,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 07:49:25,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 07:49:25,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 07:49:25,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 07:49:25,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 07:49:25,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 07:49:25,152 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 07:49:25,152 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 07:49:25,152 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 07:49:25,153 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 07:49:25,153 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 07:49:25,153 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 07:49:25,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 07:49:25,154 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 07:49:25,155 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 07:49:25,155 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 07:49:25,155 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 07:49:25,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 07:49:25,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:49:25,157 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 07:49:25,157 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 07:49:25,157 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 07:49:25,158 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 07:49:25,158 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 07:49:25,158 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 07:49:25,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 07:49:25,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 07:49:25,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 07:49:25,161 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2bc4b1110ac40ac45fd6b768f4c3036267384ecb556aaf76493d3204f3559707 [2024-11-20 07:49:25,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 07:49:25,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 07:49:25,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 07:49:25,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 07:49:25,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 07:49:25,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-20 07:49:27,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 07:49:27,256 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 07:49:27,258 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i [2024-11-20 07:49:27,275 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07d9be1e/6d96c0e918c449d8b6c7935683a18f3f/FLAGcbcda3093 [2024-11-20 07:49:27,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f07d9be1e/6d96c0e918c449d8b6c7935683a18f3f [2024-11-20 07:49:27,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 07:49:27,624 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 07:49:27,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 07:49:27,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 07:49:27,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 07:49:27,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:27,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79565318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27, skipping insertion in model container [2024-11-20 07:49:27,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:27,663 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 07:49:27,853 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2024-11-20 07:49:27,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:49:27,927 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 07:49:27,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-90.i[915,928] [2024-11-20 07:49:27,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 07:49:27,997 INFO L204 MainTranslator]: Completed translation [2024-11-20 07:49:27,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27 WrapperNode [2024-11-20 07:49:27,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 07:49:27,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 07:49:28,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 07:49:28,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 07:49:28,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,054 INFO L138 Inliner]: procedures = 27, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-20 07:49:28,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 07:49:28,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 07:49:28,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 07:49:28,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 07:49:28,066 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,091 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 07:49:28,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,108 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 07:49:28,121 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 07:49:28,122 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 07:49:28,122 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 07:49:28,123 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (1/1) ... [2024-11-20 07:49:28,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 07:49:28,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 07:49:28,156 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 07:49:28,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 07:49:28,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 07:49:28,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 07:49:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 07:49:28,204 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 07:49:28,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 07:49:28,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 07:49:28,286 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 07:49:28,289 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 07:49:28,522 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 07:49:28,523 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 07:49:28,537 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 07:49:28,538 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 07:49:28,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:28 BoogieIcfgContainer [2024-11-20 07:49:28,542 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 07:49:28,543 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 07:49:28,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 07:49:28,546 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 07:49:28,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:49:27" (1/3) ... [2024-11-20 07:49:28,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334ba601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:49:28, skipping insertion in model container [2024-11-20 07:49:28,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:49:27" (2/3) ... [2024-11-20 07:49:28,547 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@334ba601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:49:28, skipping insertion in model container [2024-11-20 07:49:28,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:28" (3/3) ... [2024-11-20 07:49:28,549 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-90.i [2024-11-20 07:49:28,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 07:49:28,563 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 07:49:28,624 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 07:49:28,630 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;@3d66edcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 07:49:28,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 07:49:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:49:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:49:28,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:28,646 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:28,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:28,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:28,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1387335848, now seen corresponding path program 1 times [2024-11-20 07:49:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:49:28,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649382702] [2024-11-20 07:49:28,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:28,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:49:28,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:49:28,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 07:49:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:28,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 07:49:28,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:49:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2024-11-20 07:49:28,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:49:28,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:49:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649382702] [2024-11-20 07:49:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649382702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:49:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:49:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 07:49:28,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305869057] [2024-11-20 07:49:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:49:28,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 07:49:28,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:49:28,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 07:49:28,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:49:28,962 INFO L87 Difference]: Start difference. First operand has 51 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 07:49:28,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:49:28,991 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2024-11-20 07:49:28,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 07:49:28,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 107 [2024-11-20 07:49:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:49:29,002 INFO L225 Difference]: With dead ends: 95 [2024-11-20 07:49:29,002 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 07:49:29,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 07:49:29,012 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 07:49:29,013 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 07:49:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 07:49:29,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-20 07:49:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-20 07:49:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 68 transitions. [2024-11-20 07:49:29,062 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 68 transitions. Word has length 107 [2024-11-20 07:49:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:49:29,062 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 68 transitions. [2024-11-20 07:49:29,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-20 07:49:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 68 transitions. [2024-11-20 07:49:29,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:49:29,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:29,070 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:29,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 07:49:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:29,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash 2101967718, now seen corresponding path program 1 times [2024-11-20 07:49:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:49:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689416328] [2024-11-20 07:49:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:49:29,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:49:29,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 07:49:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:29,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 07:49:29,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:49:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 07:49:32,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 07:49:32,947 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:49:32,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689416328] [2024-11-20 07:49:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689416328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 07:49:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 07:49:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 07:49:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635241972] [2024-11-20 07:49:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:49:32,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 07:49:32,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:49:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 07:49:32,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-20 07:49:32,954 INFO L87 Difference]: Start difference. First operand 47 states and 68 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:49:34,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:49:34,660 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2024-11-20 07:49:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 07:49:34,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 107 [2024-11-20 07:49:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:49:34,663 INFO L225 Difference]: With dead ends: 128 [2024-11-20 07:49:34,664 INFO L226 Difference]: Without dead ends: 126 [2024-11-20 07:49:34,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=725, Unknown=0, NotChecked=0, Total=930 [2024-11-20 07:49:34,666 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 180 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 07:49:34,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 389 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 07:49:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-20 07:49:34,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2024-11-20 07:49:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 52 states have internal predecessors, (61), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:49:34,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 129 transitions. [2024-11-20 07:49:34,701 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 129 transitions. Word has length 107 [2024-11-20 07:49:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:49:34,703 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 129 transitions. [2024-11-20 07:49:34,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:49:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 129 transitions. [2024-11-20 07:49:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-20 07:49:34,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:34,708 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:34,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 07:49:34,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:34,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:34,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash -417992216, now seen corresponding path program 1 times [2024-11-20 07:49:34,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:49:34,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771007695] [2024-11-20 07:49:34,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:34,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:34,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:49:34,914 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:49:34,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 07:49:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:35,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 07:49:35,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:49:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 160 proven. 6 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-20 07:49:35,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:49:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 6 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 07:49:35,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:49:35,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771007695] [2024-11-20 07:49:35,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771007695] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 07:49:35,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 07:49:35,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-20 07:49:35,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373559794] [2024-11-20 07:49:35,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 07:49:35,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 07:49:35,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:49:35,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 07:49:35,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-20 07:49:35,330 INFO L87 Difference]: Start difference. First operand 90 states and 129 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 07:49:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:49:35,803 INFO L93 Difference]: Finished difference Result 150 states and 207 transitions. [2024-11-20 07:49:35,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 07:49:35,807 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) Word has length 107 [2024-11-20 07:49:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:49:35,809 INFO L225 Difference]: With dead ends: 150 [2024-11-20 07:49:35,809 INFO L226 Difference]: Without dead ends: 106 [2024-11-20 07:49:35,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2024-11-20 07:49:35,814 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 07:49:35,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 224 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 07:49:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-20 07:49:35,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-11-20 07:49:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 34 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:49:35,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2024-11-20 07:49:35,842 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 134 transitions. Word has length 107 [2024-11-20 07:49:35,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:49:35,845 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 134 transitions. [2024-11-20 07:49:35,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 3 states have call successors, (19), 3 states have call predecessors, (19), 5 states have return successors, (20), 3 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-20 07:49:35,846 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2024-11-20 07:49:35,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-20 07:49:35,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:35,847 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:35,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-20 07:49:36,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:36,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:36,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 331001653, now seen corresponding path program 1 times [2024-11-20 07:49:36,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:49:36,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532271579] [2024-11-20 07:49:36,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:36,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:49:36,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:49:36,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 07:49:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:36,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 07:49:36,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:49:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 07:49:39,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:49:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 07:49:47,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:49:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532271579] [2024-11-20 07:49:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532271579] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 07:49:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:49:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-20 07:49:47,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327685140] [2024-11-20 07:49:47,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:49:47,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 07:49:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:49:47,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 07:49:47,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2024-11-20 07:49:47,465 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:49:49,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:49:49,334 INFO L93 Difference]: Finished difference Result 117 states and 147 transitions. [2024-11-20 07:49:49,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 07:49:49,335 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 108 [2024-11-20 07:49:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:49:49,337 INFO L225 Difference]: With dead ends: 117 [2024-11-20 07:49:49,337 INFO L226 Difference]: Without dead ends: 115 [2024-11-20 07:49:49,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=188, Invalid=804, Unknown=0, NotChecked=0, Total=992 [2024-11-20 07:49:49,339 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 159 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 07:49:49,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 357 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 07:49:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-20 07:49:49,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2024-11-20 07:49:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 states have internal predecessors, (72), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:49:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2024-11-20 07:49:49,358 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 108 [2024-11-20 07:49:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:49:49,359 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2024-11-20 07:49:49,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:49:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2024-11-20 07:49:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:49:49,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:49:49,361 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:49:49,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 07:49:49,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:49,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:49:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:49:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1432785787, now seen corresponding path program 1 times [2024-11-20 07:49:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:49:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815051161] [2024-11-20 07:49:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:49:49,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:49:49,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:49:49,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:49:49,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 07:49:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:49:49,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-20 07:49:49,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:49:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 441 proven. 54 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-20 07:49:53,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:50:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 07:50:01,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:50:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815051161] [2024-11-20 07:50:01,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815051161] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 07:50:01,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:50:01,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [35] total 48 [2024-11-20 07:50:01,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376527120] [2024-11-20 07:50:01,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:50:01,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 07:50:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:50:01,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 07:50:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1895, Unknown=0, NotChecked=0, Total=2256 [2024-11-20 07:50:01,483 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:50:04,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:50:04,712 INFO L93 Difference]: Finished difference Result 131 states and 159 transitions. [2024-11-20 07:50:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 07:50:04,713 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-20 07:50:04,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:50:04,715 INFO L225 Difference]: With dead ends: 131 [2024-11-20 07:50:04,715 INFO L226 Difference]: Without dead ends: 129 [2024-11-20 07:50:04,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=446, Invalid=2416, Unknown=0, NotChecked=0, Total=2862 [2024-11-20 07:50:04,717 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 102 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 07:50:04,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 172 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 07:50:04,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-20 07:50:04,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2024-11-20 07:50:04,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 07:50:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 146 transitions. [2024-11-20 07:50:04,749 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 146 transitions. Word has length 109 [2024-11-20 07:50:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:50:04,750 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 146 transitions. [2024-11-20 07:50:04,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:50:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 146 transitions. [2024-11-20 07:50:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-20 07:50:04,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 07:50:04,752 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 07:50:04,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 07:50:04,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:50:04,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 07:50:04,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 07:50:04,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1434632829, now seen corresponding path program 1 times [2024-11-20 07:50:04,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 07:50:04,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37366521] [2024-11-20 07:50:04,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 07:50:04,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:50:04,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 07:50:04,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 07:50:04,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 07:50:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 07:50:05,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 07:50:05,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 07:50:07,765 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 217 proven. 36 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2024-11-20 07:50:07,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 07:50:19,063 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-11-20 07:50:19,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 07:50:19,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37366521] [2024-11-20 07:50:19,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37366521] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 07:50:19,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 07:50:19,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 28 [2024-11-20 07:50:19,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565816395] [2024-11-20 07:50:19,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 07:50:19,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 07:50:19,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 07:50:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 07:50:19,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=596, Unknown=0, NotChecked=0, Total=756 [2024-11-20 07:50:19,066 INFO L87 Difference]: Start difference. First operand 118 states and 146 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:50:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 07:50:21,578 INFO L93 Difference]: Finished difference Result 124 states and 152 transitions. [2024-11-20 07:50:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 07:50:21,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-20 07:50:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 07:50:21,580 INFO L225 Difference]: With dead ends: 124 [2024-11-20 07:50:21,580 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 07:50:21,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2024-11-20 07:50:21,583 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 136 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 07:50:21,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 312 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 07:50:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 07:50:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 07:50:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 07:50:21,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 07:50:21,585 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2024-11-20 07:50:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 07:50:21,585 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 07:50:21,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (17), 1 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-20 07:50:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 07:50:21,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 07:50:21,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 07:50:21,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-20 07:50:21,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 07:50:21,792 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 07:50:21,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 07:50:45,172 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 07:50:45,191 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 07:50:45,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~stepLocal_1~0 [2024-11-20 07:50:45,192 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-20 07:50:45,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-20 07:50:45,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-20 07:50:45,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-20 07:50:45,194 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-20 07:50:45,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-20 07:50:45,195 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-20 07:50:45,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-20 07:50:45,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-20 07:50:45,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-20 07:50:45,196 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-20 07:50:45,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-20 07:50:45,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-11-20 07:50:45,197 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-20 07:50:45,211 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-20 07:50:45,211 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~64 [2024-11-20 07:50:45,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:50:45 BoogieIcfgContainer [2024-11-20 07:50:45,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 07:50:45,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 07:50:45,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 07:50:45,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 07:50:45,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:49:28" (3/4) ... [2024-11-20 07:50:45,226 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 07:50:45,230 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 07:50:45,235 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 07:50:45,237 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 07:50:45,238 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 07:50:45,238 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 07:50:45,342 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 07:50:45,342 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 07:50:45,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 07:50:45,344 INFO L158 Benchmark]: Toolchain (without parser) took 77719.27ms. Allocated memory was 75.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.8MB in the beginning and 954.2MB in the end (delta: -910.4MB). Peak memory consumption was 189.4MB. Max. memory is 16.1GB. [2024-11-20 07:50:45,344 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 54.5MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:50:45,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.98ms. Allocated memory is still 75.5MB. Free memory was 43.6MB in the beginning and 48.5MB in the end (delta: -4.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2024-11-20 07:50:45,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.77ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 46.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 07:50:45,345 INFO L158 Benchmark]: Boogie Preprocessor took 64.59ms. Allocated memory is still 75.5MB. Free memory was 46.8MB in the beginning and 43.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 07:50:45,345 INFO L158 Benchmark]: RCFGBuilder took 420.25ms. Allocated memory is still 75.5MB. Free memory was 43.9MB in the beginning and 28.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 07:50:45,346 INFO L158 Benchmark]: TraceAbstraction took 76676.51ms. Allocated memory was 75.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 28.0MB in the beginning and 960.5MB in the end (delta: -932.5MB). Peak memory consumption was 685.4MB. Max. memory is 16.1GB. [2024-11-20 07:50:45,346 INFO L158 Benchmark]: Witness Printer took 122.15ms. Allocated memory is still 1.2GB. Free memory was 960.5MB in the beginning and 954.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 07:50:45,347 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.65ms. Allocated memory is still 54.5MB. Free memory is still 37.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.98ms. Allocated memory is still 75.5MB. Free memory was 43.6MB in the beginning and 48.5MB in the end (delta: -4.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.77ms. Allocated memory is still 75.5MB. Free memory was 48.5MB in the beginning and 46.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.59ms. Allocated memory is still 75.5MB. Free memory was 46.8MB in the beginning and 43.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 420.25ms. Allocated memory is still 75.5MB. Free memory was 43.9MB in the beginning and 28.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 76676.51ms. Allocated memory was 75.5MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 28.0MB in the beginning and 960.5MB in the end (delta: -932.5MB). Peak memory consumption was 685.4MB. Max. memory is 16.1GB. * Witness Printer took 122.15ms. Allocated memory is still 1.2GB. Free memory was 960.5MB in the beginning and 954.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~stepLocal_1~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~64 * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.2s, OverallIterations: 6, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 663 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 648 mSDsluCounter, 1522 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1115 mSDsCounter, 261 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 261 mSolverCounterUnsat, 407 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1113 GetRequests, 953 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 14.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=5, InterpolantAutomatonStates: 73, 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, 6 MinimizatonAttempts, 56 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 41.1s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1070 ConstructedInterpolants, 17 QuantifiedInterpolants, 12293 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1066 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 10 InterpolantComputations, 5 PerfectInterpolantSequences, 5302/5440 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 103]: Loop Invariant Derived loop invariant: (((((var_1_15 <= 1) && (2 == last_1_var_1_6)) && (var_1_6 == 2)) && (var_1_15 >= 1)) || ((((((2 * var_1_11) < var_1_11) || (var_1_16 == var_1_15)) && (var_1_16 <= 1)) && (var_1_15 >= 1)) && (!((2 * var_1_11) < var_1_11) || (var_1_16 == var_1_15)))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((var_1_15 <= 1) && (var_1_15 >= 1)) || ((((var_1_15 <= 1) && (var_1_16 >= 1)) && (var_1_16 <= 1)) && (var_1_15 >= 1))) Ensures: (((((var_1_15 <= 1) && (var_1_15 >= 1)) || ((((var_1_15 <= 1) && (var_1_16 >= 1)) && (var_1_16 <= 1)) && (var_1_15 >= 1))) && (0 != cond)) && ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_6 == \old(last_1_var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 07:50:45,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE