./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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-46.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 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:12:58,804 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:12:58,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:12:58,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:12:58,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:12:58,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:12:58,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:12:58,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:12:58,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:12:58,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:12:58,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:12:58,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:12:58,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:12:58,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:12:58,951 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:12:58,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:12:58,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:12:58,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:12:58,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:12:58,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:12:58,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:12:58,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:12:58,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:12:58,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:12:58,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:12:58,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:12:58,957 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:12:58,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:12:58,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:12:58,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:12:58,958 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:12:58,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:12:58,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:12:58,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:12:58,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:12:58,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:12:58,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:12:58,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:12:58,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:12:58,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:12:58,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:12:58,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:12:58,962 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 -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2024-11-12 06:12:59,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:12:59,279 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:12:59,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:12:59,284 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:12:59,285 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:12:59,286 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-46.i [2024-11-12 06:13:00,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:01,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:01,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2024-11-12 06:13:01,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee094636/1cd0e4e22a4a4c54a0678678872e0d3a/FLAG237eb7fca [2024-11-12 06:13:01,418 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ee094636/1cd0e4e22a4a4c54a0678678872e0d3a [2024-11-12 06:13:01,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:01,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:01,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:01,426 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:01,433 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:01,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70de96a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01, skipping insertion in model container [2024-11-12 06:13:01,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,467 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:01,666 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-46.i[915,928] [2024-11-12 06:13:01,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:01,752 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:01,775 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-46.i[915,928] [2024-11-12 06:13:01,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:01,878 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:01,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01 WrapperNode [2024-11-12 06:13:01,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:01,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:01,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:01,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:01,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,939 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-12 06:13:01,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:01,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:01,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:01,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:01,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,955 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,974 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-12 06:13:01,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,980 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,991 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:01,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:01,996 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:01,996 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:01,996 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:01,997 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (1/1) ... [2024-11-12 06:13:02,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:02,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:02,038 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-12 06:13:02,045 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-12 06:13:02,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:02,091 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:13:02,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:02,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:02,182 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:02,185 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:02,426 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:02,426 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:02,441 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:02,441 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:02,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:02 BoogieIcfgContainer [2024-11-12 06:13:02,442 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:02,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:02,445 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:02,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:02,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:01" (1/3) ... [2024-11-12 06:13:02,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c36cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:02, skipping insertion in model container [2024-11-12 06:13:02,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:01" (2/3) ... [2024-11-12 06:13:02,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c36cf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:02, skipping insertion in model container [2024-11-12 06:13:02,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:02" (3/3) ... [2024-11-12 06:13:02,455 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2024-11-12 06:13:02,472 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:02,473 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:02,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:02,542 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;@54f0a54f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:02,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:13:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 06:13:02,556 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:02,557 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:02,558 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:02,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2106783137, now seen corresponding path program 1 times [2024-11-12 06:13:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444283851] [2024-11-12 06:13:02,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:02,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:13:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:13:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:13:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 06:13:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-12 06:13:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 06:13:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 06:13:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 06:13:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 06:13:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 06:13:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 06:13:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 06:13:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 06:13:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-12 06:13:02,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:02,954 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-12 06:13:02,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:13:02,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444283851] [2024-11-12 06:13:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444283851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:02,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:02,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050507705] [2024-11-12 06:13:02,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:02,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:02,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:13:02,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:02,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:03,001 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:13:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:03,027 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2024-11-12 06:13:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:03,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-11-12 06:13:03,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:03,039 INFO L225 Difference]: With dead ends: 83 [2024-11-12 06:13:03,040 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 06:13:03,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-12 06:13:03,048 INFO L435 NwaCegarLoop]: 56 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, 56 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-12 06:13:03,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:03,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 06:13:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 06:13:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:13:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-12 06:13:03,096 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2024-11-12 06:13:03,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:03,096 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-12 06:13:03,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:13:03,097 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-12 06:13:03,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 06:13:03,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:03,104 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:03,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:13:03,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:03,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:03,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1448015593, now seen corresponding path program 1 times [2024-11-12 06:13:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:13:03,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923422867] [2024-11-12 06:13:03,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:03,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:13:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:03,286 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:13:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:13:03,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:13:03,439 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:13:03,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:13:03,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:13:03,448 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:13:03,532 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:13:03,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:13:03 BoogieIcfgContainer [2024-11-12 06:13:03,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:13:03,539 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:13:03,539 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:13:03,539 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:13:03,540 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:02" (3/4) ... [2024-11-12 06:13:03,543 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:13:03,545 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:13:03,546 INFO L158 Benchmark]: Toolchain (without parser) took 2123.04ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 97.8MB in the beginning and 168.2MB in the end (delta: -70.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:03,549 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:03,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 453.72ms. Allocated memory is still 163.6MB. Free memory was 97.4MB in the beginning and 133.5MB in the end (delta: -36.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. [2024-11-12 06:13:03,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.59ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:03,551 INFO L158 Benchmark]: Boogie Preprocessor took 52.96ms. Allocated memory is still 163.6MB. Free memory was 131.4MB in the beginning and 129.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:13:03,551 INFO L158 Benchmark]: RCFGBuilder took 446.43ms. Allocated memory is still 163.6MB. Free memory was 129.3MB in the beginning and 116.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:13:03,552 INFO L158 Benchmark]: TraceAbstraction took 1093.00ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 115.2MB in the beginning and 168.2MB in the end (delta: -52.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:03,554 INFO L158 Benchmark]: Witness Printer took 6.28ms. Allocated memory is still 209.7MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:13:03,556 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.20ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 453.72ms. Allocated memory is still 163.6MB. Free memory was 97.4MB in the beginning and 133.5MB in the end (delta: -36.1MB). Peak memory consumption was 10.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.59ms. Allocated memory is still 163.6MB. Free memory was 133.5MB in the beginning and 131.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.96ms. Allocated memory is still 163.6MB. Free memory was 131.4MB in the beginning and 129.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 446.43ms. Allocated memory is still 163.6MB. Free memory was 129.3MB in the beginning and 116.1MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1093.00ms. Allocated memory was 163.6MB in the beginning and 209.7MB in the end (delta: 46.1MB). Free memory was 115.2MB in the beginning and 168.2MB in the end (delta: -52.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.28ms. Allocated memory is still 209.7MB. Free memory is still 168.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 255.3; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 1000000000000.5; [L25] double var_1_4 = 999999999.125; [L26] signed long int var_1_5 = 0; [L27] signed long int var_1_6 = 100; [L28] signed long int var_1_7 = 256; [L29] signed long int var_1_8 = -5; [L30] double var_1_9 = 24.2; [L31] double var_1_10 = -0.125; [L32] double var_1_11 = -0.5; VAL [isInitial=0, var_1_1=2553/10, var_1_2=0, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L78] isInitial = 1 [L79] FCALL initially() [L80] COND TRUE 1 [L81] FCALL updateLastVariables() [L82] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=2553/10, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_3=2000000000001/2, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L50] var_1_3 = __VERIFIER_nondet_double() [L51] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L51] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_4=7999999993/8, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L52] var_1_4 = __VERIFIER_nondet_double() [L53] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L53] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=0, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L54] var_1_5 = __VERIFIER_nondet_long() [L55] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L55] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L56] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=100, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L57] var_1_6 = __VERIFIER_nondet_long() [L58] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L58] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L59] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=256, var_1_8=-5, var_1_9=121/5] [L60] var_1_7 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L61] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L62] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=-5, var_1_9=121/5] [L63] var_1_8 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L64] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L65] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5, var_1_9=121/5] [L66] var_1_9 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L67] RET assume_abort_if_not((var_1_9 >= -461168.6018427382800e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L68] var_1_10 = __VERIFIER_nondet_double() [L69] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L69] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L82] RET updateVariables() [L83] CALL step() [L36] signed long int stepLocal_0 = (((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7)); VAL [isInitial=1, stepLocal_0=4, var_1_1=2553/10, var_1_2=1, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))) VAL [isInitial=1, stepLocal_0=4, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L44] var_1_11 = var_1_3 VAL [isInitial=1, stepLocal_0=4, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L83] RET step() [L84] CALL, EXPR property() [L74-L75] return (var_1_2 ? (var_1_1 == ((double) ((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4))))) : ((((((((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) > (var_1_7)) ? (((((var_1_5) < (var_1_6)) ? (var_1_5) : (var_1_6)))) : (var_1_7))) < var_1_8) ? (var_1_1 == ((double) (var_1_9 + var_1_10))) : 1)) && (var_1_11 == ((double) var_1_3)) ; VAL [\result=0, isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L84] RET, EXPR property() [L84] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] [L19] reach_error() VAL [isInitial=1, var_1_11=1000000000005, var_1_1=1000000000005, var_1_2=1, var_1_3=1000000000005, var_1_4=1000000000005, var_1_5=4, var_1_6=4, var_1_7=4, var_1_8=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, TraceHistogramMax: 14, 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, 56 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, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 89 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 364/364 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-12 06:13:03,592 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-46.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 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:13:06,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:13:06,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:13:06,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:13:06,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:13:06,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:13:06,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:13:06,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:13:06,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:13:06,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:13:06,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:13:06,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:13:06,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:13:06,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:13:06,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:13:06,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:13:06,195 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:13:06,195 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:13:06,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:13:06,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:13:06,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:13:06,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:13:06,201 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:13:06,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:13:06,201 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:13:06,201 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:13:06,202 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:13:06,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:13:06,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:13:06,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:13:06,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:13:06,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:13:06,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:13:06,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:13:06,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:06,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:13:06,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:13:06,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:13:06,208 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:13:06,208 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:13:06,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:13:06,209 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:13:06,209 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:13:06,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:13:06,209 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 -> 4a308eb18926ee1b904bfd6b10e1895d29d262c0ba78b97b1e51aab5a345984c [2024-11-12 06:13:06,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:13:06,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:13:06,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:13:06,631 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:13:06,632 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:13:06,634 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-46.i [2024-11-12 06:13:08,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:13:08,545 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:13:08,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-46.i [2024-11-12 06:13:08,553 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7638644/a3b9baadcb32458ca5005868adbc2e68/FLAG6a2b252db [2024-11-12 06:13:08,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc7638644/a3b9baadcb32458ca5005868adbc2e68 [2024-11-12 06:13:08,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:13:08,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:13:08,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:08,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:13:08,916 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:13:08,917 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:08" (1/1) ... [2024-11-12 06:13:08,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b99760a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:08, skipping insertion in model container [2024-11-12 06:13:08,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:13:08" (1/1) ... [2024-11-12 06:13:08,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:13:09,153 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-46.i[915,928] [2024-11-12 06:13:09,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:09,229 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:13:09,245 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-46.i[915,928] [2024-11-12 06:13:09,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:13:09,324 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:13:09,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09 WrapperNode [2024-11-12 06:13:09,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:13:09,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:09,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:13:09,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:13:09,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,387 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 92 [2024-11-12 06:13:09,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:13:09,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:13:09,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:13:09,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:13:09,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,430 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-12 06:13:09,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,445 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:13:09,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:13:09,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:13:09,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:13:09,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (1/1) ... [2024-11-12 06:13:09,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:13:09,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:13:09,501 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-12 06:13:09,508 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-12 06:13:09,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:13:09,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:13:09,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:13:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:13:09,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:13:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:13:09,656 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:13:09,659 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:13:10,344 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:13:10,344 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:13:10,360 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:13:10,360 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:13:10,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:10 BoogieIcfgContainer [2024-11-12 06:13:10,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:13:10,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:13:10,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:13:10,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:13:10,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:13:08" (1/3) ... [2024-11-12 06:13:10,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b96606a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:10, skipping insertion in model container [2024-11-12 06:13:10,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:13:09" (2/3) ... [2024-11-12 06:13:10,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b96606a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:13:10, skipping insertion in model container [2024-11-12 06:13:10,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:13:10" (3/3) ... [2024-11-12 06:13:10,376 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-46.i [2024-11-12 06:13:10,391 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:13:10,391 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:13:10,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:13:10,466 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;@45ecaaba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:13:10,467 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:13:10,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:13:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 06:13:10,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:10,497 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:10,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:10,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2106783137, now seen corresponding path program 1 times [2024-11-12 06:13:10,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:10,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359820649] [2024-11-12 06:13:10,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:10,526 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-12 06:13:10,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:10,530 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-12 06:13:10,531 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-12 06:13:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:10,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:13:10,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-12 06:13:10,864 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:13:10,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:13:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359820649] [2024-11-12 06:13:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359820649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:13:10,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:13:10,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:13:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517859942] [2024-11-12 06:13:10,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:13:10,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:13:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:13:10,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:13:10,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:13:10,904 INFO L87 Difference]: Start difference. First operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:13:10,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:13:10,932 INFO L93 Difference]: Finished difference Result 83 states and 134 transitions. [2024-11-12 06:13:10,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:13:10,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 90 [2024-11-12 06:13:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:13:10,948 INFO L225 Difference]: With dead ends: 83 [2024-11-12 06:13:10,949 INFO L226 Difference]: Without dead ends: 41 [2024-11-12 06:13:10,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-12 06:13:10,959 INFO L435 NwaCegarLoop]: 56 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, 56 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-12 06:13:10,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:13:10,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-12 06:13:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-12 06:13:11,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-12 06:13:11,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2024-11-12 06:13:11,013 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 90 [2024-11-12 06:13:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:13:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2024-11-12 06:13:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-12 06:13:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2024-11-12 06:13:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 06:13:11,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:13:11,022 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 06:13:11,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 06:13:11,223 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-12 06:13:11,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:13:11,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:13:11,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1448015593, now seen corresponding path program 1 times [2024-11-12 06:13:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:13:11,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988870313] [2024-11-12 06:13:11,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:13:11,227 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-12 06:13:11,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:13:11,231 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-12 06:13:11,233 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-12 06:13:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:13:11,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 06:13:11,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:13:33,797 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 118 proven. 60 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2024-11-12 06:13:33,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:14:24,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:24,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988870313] [2024-11-12 06:14:24,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988870313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 06:14:24,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1977420807] [2024-11-12 06:14:24,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:24,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 06:14:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 06:14:24,639 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-12 06:14:24,640 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-12 06:14:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:25,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 06:14:25,261 INFO L279 TraceCheckSpWp]: Computing forward predicates...