./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_amount10_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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_amount10_file-25.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 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:18:17,739 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:18:17,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:18:17,802 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:18:17,803 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:18:17,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:18:17,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:18:17,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:18:17,828 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:18:17,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:18:17,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:18:17,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:18:17,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:18:17,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:18:17,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:18:17,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:18:17,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:18:17,832 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:18:17,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:18:17,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:18:17,833 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:18:17,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:18:17,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:18:17,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:18:17,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:18:17,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:18:17,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:18:17,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:18:17,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:18:17,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:18:17,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:18:17,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:18:17,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:17,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:18:17,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:18:17,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:18:17,839 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 -> 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c [2024-10-24 10:18:18,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:18:18,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:18:18,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:18:18,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:18:18,061 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:18:18,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2024-10-24 10:18:19,358 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:18:19,519 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:18:19,520 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2024-10-24 10:18:19,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab912600/a754f663828746b9ba7bab167cf54740/FLAG83ac8ab95 [2024-10-24 10:18:19,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ab912600/a754f663828746b9ba7bab167cf54740 [2024-10-24 10:18:19,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:18:19,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:18:19,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:19,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:18:19,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:18:19,548 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@604117f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19, skipping insertion in model container [2024-10-24 10:18:19,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:18:19,698 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i[915,928] [2024-10-24 10:18:19,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:19,735 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:18:19,745 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i[915,928] [2024-10-24 10:18:19,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:19,767 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:18:19,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19 WrapperNode [2024-10-24 10:18:19,767 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:19,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:19,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:18:19,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:18:19,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,799 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-10-24 10:18:19,800 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:19,800 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:18:19,800 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:18:19,801 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:18:19,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:18:19,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:18:19,838 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:18:19,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:18:19,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:18:19,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (1/1) ... [2024-10-24 10:18:19,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:19,876 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-10-24 10:18:19,879 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-10-24 10:18:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:18:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:18:19,918 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:18:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:18:19,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:18:19,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:18:19,978 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:18:19,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:18:20,142 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:18:20,142 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:18:20,179 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:18:20,179 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:18:20,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:20 BoogieIcfgContainer [2024-10-24 10:18:20,179 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:18:20,181 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:18:20,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:18:20,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:18:20,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:18:19" (1/3) ... [2024-10-24 10:18:20,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ecce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:20, skipping insertion in model container [2024-10-24 10:18:20,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:19" (2/3) ... [2024-10-24 10:18:20,187 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ecce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:20, skipping insertion in model container [2024-10-24 10:18:20,188 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:20" (3/3) ... [2024-10-24 10:18:20,189 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-25.i [2024-10-24 10:18:20,203 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:18:20,204 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:18:20,266 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:18:20,272 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;@63c73a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:18:20,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:18:20,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:20,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 10:18:20,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:20,287 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:20,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:20,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:20,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1419770461, now seen corresponding path program 1 times [2024-10-24 10:18:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508495873] [2024-10-24 10:18:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:20,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:18:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:18:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:18:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:18:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:18:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 10:18:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:20,483 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:20,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:18:20,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508495873] [2024-10-24 10:18:20,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508495873] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:20,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:20,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:18:20,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882831887] [2024-10-24 10:18:20,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:20,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:18:20,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:18:20,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:18:20,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:20,515 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:18:20,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:20,536 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2024-10-24 10:18:20,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:18:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-10-24 10:18:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:20,544 INFO L225 Difference]: With dead ends: 51 [2024-10-24 10:18:20,544 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 10:18:20,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:20,549 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:20,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 10:18:20,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 10:18:20,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:20,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-24 10:18:20,579 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 40 [2024-10-24 10:18:20,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:20,579 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-24 10:18:20,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:18:20,579 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-24 10:18:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 10:18:20,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:20,581 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:20,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:18:20,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:20,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:20,582 INFO L85 PathProgramCache]: Analyzing trace with hash -770560167, now seen corresponding path program 1 times [2024-10-24 10:18:20,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:18:20,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272885042] [2024-10-24 10:18:20,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:18:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:18:20,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:18:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:18:20,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:18:20,668 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:18:20,669 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:18:20,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:18:20,674 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-24 10:18:20,698 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:18:20,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:18:20 BoogieIcfgContainer [2024-10-24 10:18:20,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:18:20,701 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:18:20,701 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:18:20,701 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:18:20,702 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:20" (3/4) ... [2024-10-24 10:18:20,703 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:18:20,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:18:20,705 INFO L158 Benchmark]: Toolchain (without parser) took 1163.52ms. Allocated memory is still 172.0MB. Free memory was 121.6MB in the beginning and 56.8MB in the end (delta: 64.8MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-24 10:18:20,706 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:20,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.92ms. Allocated memory is still 172.0MB. Free memory was 121.2MB in the beginning and 107.5MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:20,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.58ms. Allocated memory is still 172.0MB. Free memory was 107.5MB in the beginning and 105.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:20,707 INFO L158 Benchmark]: Boogie Preprocessor took 36.64ms. Allocated memory is still 172.0MB. Free memory was 105.7MB in the beginning and 103.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:20,708 INFO L158 Benchmark]: RCFGBuilder took 342.01ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 90.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:20,708 INFO L158 Benchmark]: TraceAbstraction took 519.16ms. Allocated memory is still 172.0MB. Free memory was 89.4MB in the beginning and 57.2MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-24 10:18:20,708 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 172.0MB. Free memory was 57.2MB in the beginning and 56.8MB in the end (delta: 377.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:20,710 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 224.92ms. Allocated memory is still 172.0MB. Free memory was 121.2MB in the beginning and 107.5MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.58ms. Allocated memory is still 172.0MB. Free memory was 107.5MB in the beginning and 105.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.64ms. Allocated memory is still 172.0MB. Free memory was 105.7MB in the beginning and 103.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 342.01ms. Allocated memory is still 172.0MB. Free memory was 103.7MB in the beginning and 90.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 519.16ms. Allocated memory is still 172.0MB. Free memory was 89.4MB in the beginning and 57.2MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 172.0MB. Free memory was 57.2MB in the beginning and 56.8MB in the end (delta: 377.5kB). 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 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 0.742; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] double var_1_4 = 1.625; [L26] double var_1_5 = 8.25; [L65] isInitial = 1 [L66] FCALL initially() [L67] COND TRUE 1 [L68] FCALL updateLastVariables() [L69] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=371/500, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=0, var_1_4=13/8, var_1_5=33/4] [L50] var_1_3 = __VERIFIER_nondet_uchar() [L51] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_4=13/8, var_1_5=33/4] [L51] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_4=13/8, var_1_5=33/4] [L52] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_4=13/8, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_4=13/8, var_1_5=33/4] [L52] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_4=13/8, var_1_5=33/4] [L53] var_1_4 = __VERIFIER_nondet_double() [L54] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_5=33/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_5=33/4] [L54] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1, var_1_5=33/4] [L55] var_1_5 = __VERIFIER_nondet_double() [L56] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1] [L56] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=371/500, var_1_2=0, var_1_3=1] [L69] RET updateVariables() [L70] CALL step() [L30] COND FALSE !(\read(var_1_2)) [L43] var_1_1 = var_1_5 VAL [isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] [L70] RET step() [L71] CALL, EXPR property() [L61-L62] return var_1_2 ? ((! var_1_3) ? (var_1_3 ? (var_1_1 == ((double) ((((var_1_4) < (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) ? (var_1_4) : (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))))))) : 1) : ((var_1_5 <= var_1_4) ? (var_1_1 == ((double) var_1_4)) : (var_1_1 == ((double) 199.5)))) : (var_1_1 == ((double) var_1_5)) ; [L71] RET, EXPR property() [L71] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] [L19] reach_error() VAL [isInitial=1, var_1_1=53, var_1_2=0, var_1_3=1, var_1_5=53] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 31 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 60/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:18:20,732 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_amount10_file-25.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 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:18:22,686 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:18:22,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:18:22,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:18:22,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:18:22,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:18:22,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:18:22,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:18:22,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:18:22,793 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:18:22,794 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:18:22,794 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:18:22,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:18:22,795 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:18:22,795 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:18:22,798 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:18:22,798 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:18:22,798 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:18:22,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:18:22,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:18:22,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:18:22,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:18:22,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:18:22,799 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:18:22,800 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:18:22,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:18:22,800 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:18:22,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:18:22,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:18:22,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:18:22,801 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:18:22,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:18:22,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:18:22,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:18:22,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:22,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:18:22,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:18:22,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:18:22,802 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:18:22,802 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:18:22,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:18:22,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:18:22,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:18:22,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:18:22,804 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:18:22,804 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 -> 942fc1721d9d68198092543c6d2644725032e77c472db86e1b213e7c4933ab1c [2024-10-24 10:18:23,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:18:23,110 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:18:23,112 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:18:23,113 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:18:23,114 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:18:23,115 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2024-10-24 10:18:24,459 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:18:24,648 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:18:24,649 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i [2024-10-24 10:18:24,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3ac8218/268fbe9b08a04037bfe669b8b81b09fa/FLAGc6457928d [2024-10-24 10:18:25,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a3ac8218/268fbe9b08a04037bfe669b8b81b09fa [2024-10-24 10:18:25,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:18:25,036 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:18:25,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:25,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:18:25,042 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:18:25,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e806c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25, skipping insertion in model container [2024-10-24 10:18:25,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,060 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:18:25,198 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i[915,928] [2024-10-24 10:18:25,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:25,248 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:18:25,266 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-25.i[915,928] [2024-10-24 10:18:25,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:18:25,297 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:18:25,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25 WrapperNode [2024-10-24 10:18:25,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:18:25,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:25,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:18:25,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:18:25,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,329 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 65 [2024-10-24 10:18:25,329 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:18:25,330 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:18:25,330 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:18:25,330 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:18:25,338 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,339 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,354 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:18:25,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:18:25,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:18:25,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:18:25,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:18:25,368 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (1/1) ... [2024-10-24 10:18:25,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:18:25,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:18:25,401 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-10-24 10:18:25,403 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-10-24 10:18:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:18:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:18:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:18:25,439 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:18:25,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:18:25,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:18:25,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:18:25,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:18:25,692 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 10:18:25,692 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:18:25,728 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:18:25,729 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:18:25,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:25 BoogieIcfgContainer [2024-10-24 10:18:25,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:18:25,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:18:25,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:18:25,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:18:25,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:18:25" (1/3) ... [2024-10-24 10:18:25,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f90b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:25, skipping insertion in model container [2024-10-24 10:18:25,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:18:25" (2/3) ... [2024-10-24 10:18:25,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78f90b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:18:25, skipping insertion in model container [2024-10-24 10:18:25,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:25" (3/3) ... [2024-10-24 10:18:25,738 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-25.i [2024-10-24 10:18:25,753 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:18:25,753 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:18:25,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:18:25,819 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;@5487f4a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:18:25,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:18:25,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 10:18:25,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:25,833 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:25,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:25,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1419770461, now seen corresponding path program 1 times [2024-10-24 10:18:25,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:25,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778910629] [2024-10-24 10:18:25,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:25,854 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-10-24 10:18:25,855 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-10-24 10:18:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:25,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:18:25,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:25,992 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 10:18:25,993 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:25,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:25,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778910629] [2024-10-24 10:18:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778910629] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:25,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:18:25,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156075805] [2024-10-24 10:18:25,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:26,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:18:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:18:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:26,024 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:18:26,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:26,071 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2024-10-24 10:18:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:18:26,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 40 [2024-10-24 10:18:26,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:26,082 INFO L225 Difference]: With dead ends: 51 [2024-10-24 10:18:26,082 INFO L226 Difference]: Without dead ends: 25 [2024-10-24 10:18:26,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:18:26,089 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:26,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-10-24 10:18:26,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-24 10:18:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-10-24 10:18:26,128 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 40 [2024-10-24 10:18:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:26,128 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-10-24 10:18:26,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 10:18:26,129 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-10-24 10:18:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-24 10:18:26,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:26,131 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:26,136 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-10-24 10:18:26,335 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-10-24 10:18:26,336 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash -770560167, now seen corresponding path program 1 times [2024-10-24 10:18:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941121079] [2024-10-24 10:18:26,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:26,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:26,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:26,341 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-10-24 10:18:26,343 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-10-24 10:18:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:26,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 10:18:26,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:30,784 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-24 10:18:30,784 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:30,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:30,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941121079] [2024-10-24 10:18:30,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941121079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:30,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:30,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:18:30,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191361839] [2024-10-24 10:18:30,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:18:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:30,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:18:30,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:18:30,790 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:31,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:31,225 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2024-10-24 10:18:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 10:18:31,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 40 [2024-10-24 10:18:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:31,226 INFO L225 Difference]: With dead ends: 37 [2024-10-24 10:18:31,226 INFO L226 Difference]: Without dead ends: 35 [2024-10-24 10:18:31,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-24 10:18:31,227 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:31,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 68 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:18:31,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-24 10:18:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2024-10-24 10:18:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 10:18:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2024-10-24 10:18:31,234 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 40 [2024-10-24 10:18:31,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:31,234 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2024-10-24 10:18:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2024-10-24 10:18:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 10:18:31,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:31,236 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:31,243 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-10-24 10:18:31,436 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-10-24 10:18:31,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:31,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1918328489, now seen corresponding path program 1 times [2024-10-24 10:18:31,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:31,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478528406] [2024-10-24 10:18:31,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:31,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:31,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:31,442 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-10-24 10:18:31,443 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-10-24 10:18:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:31,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 10:18:31,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:31,515 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:31,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:31,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:31,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478528406] [2024-10-24 10:18:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1478528406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:31,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:31,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 10:18:31,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796535445] [2024-10-24 10:18:31,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:31,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 10:18:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:31,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 10:18:31,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:18:31,517 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:31,556 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2024-10-24 10:18:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 10:18:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-24 10:18:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:31,557 INFO L225 Difference]: With dead ends: 74 [2024-10-24 10:18:31,557 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 10:18:31,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 10:18:31,559 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:31,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:31,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 10:18:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-10-24 10:18:31,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 30 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:18:31,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2024-10-24 10:18:31,567 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 42 [2024-10-24 10:18:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:31,568 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2024-10-24 10:18:31,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2024-10-24 10:18:31,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 10:18:31,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:31,570 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:31,575 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 (4)] Ended with exit code 0 [2024-10-24 10:18:31,770 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-10-24 10:18:31,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:31,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:31,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1918388071, now seen corresponding path program 1 times [2024-10-24 10:18:31,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:31,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633050124] [2024-10-24 10:18:31,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:31,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:31,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:31,774 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-10-24 10:18:31,775 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-10-24 10:18:31,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:31,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 10:18:31,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:33,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:33,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:33,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633050124] [2024-10-24 10:18:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633050124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:33,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:33,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 10:18:33,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049147762] [2024-10-24 10:18:33,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:33,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:18:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:33,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:18:33,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:18:33,424 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:33,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:33,487 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-10-24 10:18:33,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:18:33,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-24 10:18:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:33,490 INFO L225 Difference]: With dead ends: 45 [2024-10-24 10:18:33,490 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 10:18:33,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:33,491 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:33,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:18:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 10:18:33,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-10-24 10:18:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:18:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-24 10:18:33,498 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-10-24 10:18:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:33,498 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-24 10:18:33,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-24 10:18:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 10:18:33,499 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:33,499 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:33,503 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 (5)] Ended with exit code 0 [2024-10-24 10:18:33,703 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-10-24 10:18:33,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:33,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1925954985, now seen corresponding path program 1 times [2024-10-24 10:18:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995329951] [2024-10-24 10:18:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:33,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:33,705 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-10-24 10:18:33,707 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-10-24 10:18:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:33,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 10:18:33,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:35,470 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 29 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 10:18:35,471 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:18:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:36,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:36,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995329951] [2024-10-24 10:18:36,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995329951] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 10:18:36,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 10:18:36,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-10-24 10:18:36,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499338504] [2024-10-24 10:18:36,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:36,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 10:18:36,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:36,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 10:18:36,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-10-24 10:18:36,648 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:37,171 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2024-10-24 10:18:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:18:37,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-24 10:18:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:37,173 INFO L225 Difference]: With dead ends: 50 [2024-10-24 10:18:37,173 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 10:18:37,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-10-24 10:18:37,174 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:37,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:18:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 10:18:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2024-10-24 10:18:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-24 10:18:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-24 10:18:37,188 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 42 [2024-10-24 10:18:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-24 10:18:37,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-24 10:18:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-24 10:18:37,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:18:37,189 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:18:37,198 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-10-24 10:18:37,389 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-10-24 10:18:37,390 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:18:37,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:18:37,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1926014567, now seen corresponding path program 1 times [2024-10-24 10:18:37,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:18:37,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950814747] [2024-10-24 10:18:37,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:18:37,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:18:37,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:18:37,392 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-10-24 10:18:37,393 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-10-24 10:18:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:18:37,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 10:18:37,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:18:38,270 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-24 10:18:38,270 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:18:38,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:18:38,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950814747] [2024-10-24 10:18:38,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950814747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:18:38,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:18:38,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 10:18:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496242013] [2024-10-24 10:18:38,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:18:38,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 10:18:38,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:18:38,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 10:18:38,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 10:18:38,271 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:18:38,397 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-10-24 10:18:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 10:18:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 42 [2024-10-24 10:18:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:18:38,398 INFO L225 Difference]: With dead ends: 47 [2024-10-24 10:18:38,398 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 10:18:38,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:18:38,399 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:18:38,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 84 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:18:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 10:18:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 10:18:38,400 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-10-24 10:18:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 10:18:38,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2024-10-24 10:18:38,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:18:38,400 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 10:18:38,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-24 10:18:38,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 10:18:38,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 10:18:38,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:18:38,411 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-10-24 10:18:38,606 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-10-24 10:18:38,610 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 10:18:38,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 10:18:39,782 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:18:39,790 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,791 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,791 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,791 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,792 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:18:39,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:18:39,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-24 10:18:39,795 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-10-24 10:18:39,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:18:39 BoogieIcfgContainer [2024-10-24 10:18:39,799 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:18:39,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:18:39,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:18:39,800 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:18:39,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:18:25" (3/4) ... [2024-10-24 10:18:39,801 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 10:18:39,804 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 10:18:39,807 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-24 10:18:39,807 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 10:18:39,807 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 10:18:39,807 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 10:18:39,889 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 10:18:39,889 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 10:18:39,889 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:18:39,890 INFO L158 Benchmark]: Toolchain (without parser) took 14854.15ms. Allocated memory was 67.1MB in the beginning and 574.6MB in the end (delta: 507.5MB). Free memory was 33.6MB in the beginning and 283.2MB in the end (delta: -249.7MB). Peak memory consumption was 258.5MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,890 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:18:39,891 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.25ms. Allocated memory is still 67.1MB. Free memory was 33.4MB in the beginning and 37.9MB in the end (delta: -4.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,891 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.81ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 36.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,891 INFO L158 Benchmark]: Boogie Preprocessor took 36.70ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 34.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,891 INFO L158 Benchmark]: RCFGBuilder took 361.92ms. Allocated memory is still 67.1MB. Free memory was 34.0MB in the beginning and 41.2MB in the end (delta: -7.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,892 INFO L158 Benchmark]: TraceAbstraction took 14068.35ms. Allocated memory was 67.1MB in the beginning and 574.6MB in the end (delta: 507.5MB). Free memory was 40.4MB in the beginning and 288.5MB in the end (delta: -248.1MB). Peak memory consumption was 257.7MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,892 INFO L158 Benchmark]: Witness Printer took 89.98ms. Allocated memory is still 574.6MB. Free memory was 288.5MB in the beginning and 283.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 10:18:39,893 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.10ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.25ms. Allocated memory is still 67.1MB. Free memory was 33.4MB in the beginning and 37.9MB in the end (delta: -4.5MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.81ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 36.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.70ms. Allocated memory is still 67.1MB. Free memory was 36.1MB in the beginning and 34.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.92ms. Allocated memory is still 67.1MB. Free memory was 34.0MB in the beginning and 41.2MB in the end (delta: -7.2MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14068.35ms. Allocated memory was 67.1MB in the beginning and 574.6MB in the end (delta: 507.5MB). Free memory was 40.4MB in the beginning and 288.5MB in the end (delta: -248.1MB). Peak memory consumption was 257.7MB. Max. memory is 16.1GB. * Witness Printer took 89.98ms. Allocated memory is still 574.6MB. Free memory was 288.5MB in the beginning and 283.2MB in the end (delta: 5.2MB). 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: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - 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: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 99 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 424 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 250 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 174 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=3, InterpolantAutomatonStates: 32, 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, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 283 ConstructedInterpolants, 2 QuantifiedInterpolants, 1104 SizeOfPredicates, 26 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 417/420 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: 67]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && ((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 10:18:39,937 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