./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.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 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:35:22,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:22,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:35:22,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:22,147 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:35:22,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:22,177 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:35:22,177 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:35:22,178 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:35:22,179 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:35:22,179 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:35:22,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:35:22,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:22,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:22,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:35:22,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:22,183 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:35:22,183 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:35:22,184 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:35:22,184 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:35:22,184 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:22,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:35:22,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:22,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:35:22,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:22,189 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:35:22,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:35:22,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:22,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:22,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:35:22,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:35:22,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:35:22,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:22,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:22,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:22,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:35:22,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:35:22,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:35:22,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:35:22,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:35:22,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:35:22,194 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:35:22,194 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 -> 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc [2024-11-09 00:35:22,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:22,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:22,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:22,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:22,481 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:22,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2024-11-09 00:35:23,873 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:24,061 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:24,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2024-11-09 00:35:24,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0119aca/b81591f9b58c4ecbb009ce277794bf22/FLAG1de46c481 [2024-11-09 00:35:24,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0119aca/b81591f9b58c4ecbb009ce277794bf22 [2024-11-09 00:35:24,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:24,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:24,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:24,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:24,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:24,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@989141e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24, skipping insertion in model container [2024-11-09 00:35:24,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:24,669 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2024-11-09 00:35:24,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:24,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:24,740 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2024-11-09 00:35:24,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:24,784 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:24,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24 WrapperNode [2024-11-09 00:35:24,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:24,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:24,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:24,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:24,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,826 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-09 00:35:24,827 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:24,828 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:24,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:24,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:24,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,862 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:35:24,862 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:24,884 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:24,884 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:24,884 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:24,885 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (1/1) ... [2024-11-09 00:35:24,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:24,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:35:24,920 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:24,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:24,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:35:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:35:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:35:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:35:24,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:24,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:25,073 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:25,076 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:25,380 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:25,380 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:25,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:25,397 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:35:25,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:25 BoogieIcfgContainer [2024-11-09 00:35:25,398 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:25,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:35:25,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:35:25,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:35:25,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:35:24" (1/3) ... [2024-11-09 00:35:25,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d366b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:25, skipping insertion in model container [2024-11-09 00:35:25,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:24" (2/3) ... [2024-11-09 00:35:25,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d366b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:25, skipping insertion in model container [2024-11-09 00:35:25,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:25" (3/3) ... [2024-11-09 00:35:25,408 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-84.i [2024-11-09 00:35:25,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:35:25,428 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:35:25,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:35:25,503 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;@55361c85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:35:25,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:35:25,508 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:35:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:35:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:25,517 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:25,518 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:25,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:25,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1105072272, now seen corresponding path program 1 times [2024-11-09 00:35:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647463421] [2024-11-09 00:35:25,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:35:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-09 00:35:25,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:25,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647463421] [2024-11-09 00:35:25,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647463421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:25,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:25,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:35:25,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753366994] [2024-11-09 00:35:25,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:25,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:35:25,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:35:25,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:25,845 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 37 states have internal predecessors, (49), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:35:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:25,870 INFO L93 Difference]: Finished difference Result 93 states and 147 transitions. [2024-11-09 00:35:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:35:25,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-11-09 00:35:25,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:25,881 INFO L225 Difference]: With dead ends: 93 [2024-11-09 00:35:25,882 INFO L226 Difference]: Without dead ends: 46 [2024-11-09 00:35:25,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:25,893 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:25,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-09 00:35:25,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-09 00:35:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:35:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2024-11-09 00:35:25,946 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 74 [2024-11-09 00:35:25,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:25,949 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2024-11-09 00:35:25,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:35:25,949 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2024-11-09 00:35:25,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 00:35:25,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:25,956 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:25,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:35:25,972 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:25,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2002271730, now seen corresponding path program 1 times [2024-11-09 00:35:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:25,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398075592] [2024-11-09 00:35:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:35:26,055 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:35:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:35:26,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:35:26,162 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:35:26,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:35:26,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:35:26,169 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:35:26,219 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:35:26,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:35:26 BoogieIcfgContainer [2024-11-09 00:35:26,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:35:26,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:35:26,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:35:26,223 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:35:26,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:25" (3/4) ... [2024-11-09 00:35:26,227 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:35:26,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:35:26,230 INFO L158 Benchmark]: Toolchain (without parser) took 1768.74ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 83.4MB in the beginning and 180.8MB in the end (delta: -97.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:26,230 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:26,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.54ms. Allocated memory is still 157.3MB. Free memory was 83.2MB in the beginning and 70.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:26,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.58ms. Allocated memory is still 157.3MB. Free memory was 70.0MB in the beginning and 67.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:26,232 INFO L158 Benchmark]: Boogie Preprocessor took 55.59ms. Allocated memory is still 157.3MB. Free memory was 67.5MB in the beginning and 65.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:26,235 INFO L158 Benchmark]: RCFGBuilder took 514.05ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 65.1MB in the beginning and 186.3MB in the end (delta: -121.2MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-09 00:35:26,236 INFO L158 Benchmark]: TraceAbstraction took 821.96ms. Allocated memory is still 224.4MB. Free memory was 185.3MB in the beginning and 180.8MB in the end (delta: 4.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2024-11-09 00:35:26,236 INFO L158 Benchmark]: Witness Printer took 5.27ms. Allocated memory is still 224.4MB. Free memory is still 180.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:26,238 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.26ms. Allocated memory is still 157.3MB. Free memory is still 108.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.54ms. Allocated memory is still 157.3MB. Free memory was 83.2MB in the beginning and 70.0MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.58ms. Allocated memory is still 157.3MB. Free memory was 70.0MB in the beginning and 67.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.59ms. Allocated memory is still 157.3MB. Free memory was 67.5MB in the beginning and 65.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 514.05ms. Allocated memory was 157.3MB in the beginning and 224.4MB in the end (delta: 67.1MB). Free memory was 65.1MB in the beginning and 186.3MB in the end (delta: -121.2MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 821.96ms. Allocated memory is still 224.4MB. Free memory was 185.3MB in the beginning and 180.8MB in the end (delta: 4.5MB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 5.27ms. Allocated memory is still 224.4MB. Free memory is still 180.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 63. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned short int var_1_2 = 128; [L24] unsigned short int var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 49.5; [L29] float var_1_8 = 16.25; VAL [isInitial=0, var_1_1=1, var_1_2=128, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L67] isInitial = 1 [L68] FCALL initially() [L69] COND TRUE 1 [L70] FCALL updateLastVariables() [L71] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L43] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L44] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L44] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_3=0, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L45] var_1_3 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L46] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L47] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L47] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L48] var_1_4 = __VERIFIER_nondet_uchar() [L49] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L49] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=1, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L50] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L50] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L51] var_1_5 = __VERIFIER_nondet_uchar() [L52] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L52] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L53] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L53] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L54] var_1_6 = __VERIFIER_nondet_uchar() [L55] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_7=99/2, var_1_8=65/4] [L55] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_7=99/2, var_1_8=65/4] [L56] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L56] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2, var_1_8=65/4] [L57] var_1_8 = __VERIFIER_nondet_float() [L58] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L58] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=1, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L71] RET updateVariables() [L72] CALL step() [L33] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=4, var_1_1=1, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L34] COND FALSE !(var_1_2 == stepLocal_0) [L37] var_1_1 = (var_1_4 && (var_1_5 && var_1_6)) VAL [isInitial=1, var_1_1=0, var_1_2=2, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=99/2] [L39] var_1_7 = var_1_8 VAL [isInitial=1, var_1_1=0, var_1_2=2, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] [L72] RET step() [L73] CALL, EXPR property() [L63] EXPR (var_1_2 == var_1_3) ? (var_1_1 == ((unsigned char) ((var_1_3 > (50 ^ var_1_2)) && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && (var_1_5 && var_1_6)))) VAL [isInitial=1, var_1_1=0, var_1_2=2, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] [L63-L64] return ((var_1_2 == var_1_3) ? (var_1_1 == ((unsigned char) ((var_1_3 > (50 ^ var_1_2)) && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && (var_1_5 && var_1_6))))) && (var_1_7 == ((float) var_1_8)) ; [L73] RET, EXPR property() [L73] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=0, var_1_2=2, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] [L19] reach_error() VAL [isInitial=1, var_1_1=0, var_1_2=2, var_1_3=4, var_1_4=0, var_1_5=1, var_1_6=0, var_1_7=133, var_1_8=133] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 11, 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, 62 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 62 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred 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.2s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 73 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 220/220 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:35:26,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.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 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:35:28,495 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:28,582 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:35:28,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:28,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:35:28,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:28,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:35:28,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:35:28,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:35:28,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:35:28,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:35:28,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:35:28,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:28,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:28,627 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:35:28,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:28,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:35:28,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:35:28,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:35:28,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:28,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:35:28,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:28,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:35:28,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:35:28,633 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:35:28,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:28,633 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:35:28,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:35:28,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:35:28,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:28,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:28,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:35:28,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:35:28,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:35:28,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:28,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:28,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:28,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:35:28,637 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:35:28,637 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:35:28,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:35:28,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:35:28,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:35:28,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:35:28,638 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 -> 3cf3add05c45b0b04bd0d1457ef1e7330de70f3c21c667f6683e915324786bcc [2024-11-09 00:35:28,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:28,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:28,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:28,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:28,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:28,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2024-11-09 00:35:30,535 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:30,748 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:30,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i [2024-11-09 00:35:30,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bf0fb79/fe9de22d37d347a39da15c692833c450/FLAG67bebe9b7 [2024-11-09 00:35:31,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70bf0fb79/fe9de22d37d347a39da15c692833c450 [2024-11-09 00:35:31,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:31,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:31,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:31,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:31,129 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:31,130 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,131 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22a7a0f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31, skipping insertion in model container [2024-11-09 00:35:31,131 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:31,347 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2024-11-09 00:35:31,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:31,411 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:31,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-84.i[915,928] [2024-11-09 00:35:31,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:31,461 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:31,462 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31 WrapperNode [2024-11-09 00:35:31,462 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:31,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:31,463 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:31,463 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:31,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,509 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 76 [2024-11-09 00:35:31,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:31,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:31,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:31,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:31,523 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,544 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:35:31,545 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:31,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:31,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:31,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:31,575 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (1/1) ... [2024-11-09 00:35:31,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:35:31,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:31,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:35:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:35:31,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:35:31,655 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:35:31,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:31,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:31,724 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:31,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:31,934 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:31,934 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:31,949 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:31,950 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:35:31,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:31 BoogieIcfgContainer [2024-11-09 00:35:31,951 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:31,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:35:31,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:35:31,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:35:31,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:35:31" (1/3) ... [2024-11-09 00:35:31,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a4916e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:31, skipping insertion in model container [2024-11-09 00:35:31,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:31" (2/3) ... [2024-11-09 00:35:31,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a4916e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:31, skipping insertion in model container [2024-11-09 00:35:31,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:31" (3/3) ... [2024-11-09 00:35:31,960 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-84.i [2024-11-09 00:35:31,974 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:35:31,975 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:35:32,028 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:35:32,037 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;@1646722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:35:32,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:35:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:35:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:35:32,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:32,054 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:32,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:32,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 228508198, now seen corresponding path program 1 times [2024-11-09 00:35:32,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:32,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232061813] [2024-11-09 00:35:32,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:32,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:32,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:32,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:32,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:35:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:32,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:35:32,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-09 00:35:32,286 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:35:32,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:32,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232061813] [2024-11-09 00:35:32,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232061813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:32,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:32,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:35:32,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600368805] [2024-11-09 00:35:32,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:32,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:35:32,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:32,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:35:32,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:32,324 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:35:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:32,341 INFO L93 Difference]: Finished difference Result 69 states and 109 transitions. [2024-11-09 00:35:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:35:32,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 72 [2024-11-09 00:35:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:32,349 INFO L225 Difference]: With dead ends: 69 [2024-11-09 00:35:32,349 INFO L226 Difference]: Without dead ends: 34 [2024-11-09 00:35:32,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:32,354 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:32,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-09 00:35:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-09 00:35:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:35:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2024-11-09 00:35:32,397 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 72 [2024-11-09 00:35:32,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:32,398 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2024-11-09 00:35:32,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 00:35:32,398 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2024-11-09 00:35:32,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:35:32,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:32,401 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:32,405 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 (2)] Ended with exit code 0 [2024-11-09 00:35:32,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:32,602 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:32,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1115505884, now seen corresponding path program 1 times [2024-11-09 00:35:32,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:32,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811507198] [2024-11-09 00:35:32,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:32,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:32,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:32,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:32,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:35:32,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:32,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 00:35:32,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:35:34,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:35:34,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811507198] [2024-11-09 00:35:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811507198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:35:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1480050507] [2024-11-09 00:35:34,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:34,835 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 00:35:34,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 00:35:34,839 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 00:35:34,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-09 00:35:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:35,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 00:35:35,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:35:35,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:35:36,443 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 00:35:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1480050507] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:35:36,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:35:36,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 13] total 29 [2024-11-09 00:35:36,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747004044] [2024-11-09 00:35:36,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:36,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:35:36,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:36,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:35:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2024-11-09 00:35:36,449 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:35:36,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:36,853 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-11-09 00:35:36,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:35:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2024-11-09 00:35:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:36,857 INFO L225 Difference]: With dead ends: 49 [2024-11-09 00:35:36,857 INFO L226 Difference]: Without dead ends: 47 [2024-11-09 00:35:36,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 00:35:36,859 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 79 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:36,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 133 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:35:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-09 00:35:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2024-11-09 00:35:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 00:35:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2024-11-09 00:35:36,880 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 72 [2024-11-09 00:35:36,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2024-11-09 00:35:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:35:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2024-11-09 00:35:36,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:35:36,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:36,884 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:36,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-09 00:35:37,089 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 (3)] Ended with exit code 0 [2024-11-09 00:35:37,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:37,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:37,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:37,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1058247582, now seen corresponding path program 1 times [2024-11-09 00:35:37,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:35:37,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578552695] [2024-11-09 00:35:37,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:37,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:37,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:35:37,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:35:37,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 00:35:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:37,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 00:35:37,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:35:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 135 proven. 12 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-09 00:35:38,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:35:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-09 00:35:38,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:35:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578552695] [2024-11-09 00:35:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578552695] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:35:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:35:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 22 [2024-11-09 00:35:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907878812] [2024-11-09 00:35:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:38,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 00:35:38,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:35:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 00:35:38,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-09 00:35:38,967 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:35:39,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:39,371 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2024-11-09 00:35:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:35:39,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 72 [2024-11-09 00:35:39,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:39,372 INFO L225 Difference]: With dead ends: 47 [2024-11-09 00:35:39,372 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:35:39,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2024-11-09 00:35:39,374 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 50 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:39,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 129 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:35:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:35:39,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:35:39,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:35:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:35:39,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2024-11-09 00:35:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:39,376 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:35:39,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-09 00:35:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:35:39,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:35:39,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:35:39,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:35:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:35:39,587 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-09 00:35:39,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:35:39,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:35:39,849 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-09 00:35:39,850 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-09 00:35:39,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-09 00:35:39,851 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-09 00:35:39,856 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~fp.eq~32 [2024-11-09 00:35:39,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:35:39 BoogieIcfgContainer [2024-11-09 00:35:39,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:35:39,862 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:35:39,862 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:35:39,862 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:35:39,863 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:31" (3/4) ... [2024-11-09 00:35:39,865 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:35:39,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:35:39,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:35:39,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:35:39,873 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:35:39,874 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:35:39,973 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:35:39,974 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:35:39,974 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:35:39,975 INFO L158 Benchmark]: Toolchain (without parser) took 8852.00ms. Allocated memory was 71.3MB in the beginning and 180.4MB in the end (delta: 109.1MB). Free memory was 37.6MB in the beginning and 72.0MB in the end (delta: -34.4MB). Peak memory consumption was 75.3MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,975 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:39,975 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.55ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 41.6MB in the end (delta: -4.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,975 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.66ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 39.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,975 INFO L158 Benchmark]: Boogie Preprocessor took 60.29ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,976 INFO L158 Benchmark]: RCFGBuilder took 376.94ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 49.3MB in the end (delta: -11.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,976 INFO L158 Benchmark]: TraceAbstraction took 7908.87ms. Allocated memory was 71.3MB in the beginning and 180.4MB in the end (delta: 109.1MB). Free memory was 48.9MB in the beginning and 77.3MB in the end (delta: -28.3MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,977 INFO L158 Benchmark]: Witness Printer took 112.11ms. Allocated memory is still 180.4MB. Free memory was 77.3MB in the beginning and 72.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 00:35:39,979 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 54.5MB. Free memory is still 37.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.55ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 41.6MB in the end (delta: -4.2MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.66ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 39.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.29ms. Allocated memory is still 71.3MB. Free memory was 39.9MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 376.94ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 49.3MB in the end (delta: -11.9MB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7908.87ms. Allocated memory was 71.3MB in the beginning and 180.4MB in the end (delta: 109.1MB). Free memory was 48.9MB in the beginning and 77.3MB in the end (delta: -28.3MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 112.11ms. Allocated memory is still 180.4MB. Free memory was 77.3MB in the beginning and 72.0MB 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: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~fp.eq~32 * 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, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 3, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 221 IncrementalHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 119 mSDtfsCounter, 221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 440 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=2, InterpolantAutomatonStates: 22, 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, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 426 ConstructedInterpolants, 5 QuantifiedInterpolants, 2006 SizeOfPredicates, 38 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 1284/1320 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: 69]: 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: (((((((((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))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:35:40,014 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