./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.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-72.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 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:14:00,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:14:00,815 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 06:14:00,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:14:00,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:14:00,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:14:00,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:14:00,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:14:00,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:14:00,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:14:00,856 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:14:00,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:14:00,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:14:00,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:14:00,857 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:14:00,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:14:00,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:14:00,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:14:00,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 06:14:00,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:14:00,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:14:00,863 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:14:00,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:14:00,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:14:00,864 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:14:00,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:14:00,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:14:00,865 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:14:00,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:14:00,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:14:00,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:14:00,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:14:00,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:00,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:14:00,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:14:00,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:14:00,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 06:14:00,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 06:14:00,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:14:00,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:14:00,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:14:00,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:14:00,868 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 -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2024-11-12 06:14:01,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:14:01,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:14:01,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:14:01,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:14:01,091 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:14:01,092 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-72.i [2024-11-12 06:14:02,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:02,460 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:02,461 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2024-11-12 06:14:02,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a61bba9a/7731c30ac1c84ab88b56345d88d4da0f/FLAG6d6a78a8b [2024-11-12 06:14:02,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a61bba9a/7731c30ac1c84ab88b56345d88d4da0f [2024-11-12 06:14:02,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:02,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:02,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:02,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:02,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:02,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d1afc7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02, skipping insertion in model container [2024-11-12 06:14:02,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:02,617 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-72.i[915,928] [2024-11-12 06:14:02,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:02,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:02,668 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-72.i[915,928] [2024-11-12 06:14:02,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:02,700 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:02,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02 WrapperNode [2024-11-12 06:14:02,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:02,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:02,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:02,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:02,708 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:14:02" (1/1) ... [2024-11-12 06:14:02,715 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:14:02" (1/1) ... [2024-11-12 06:14:02,735 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-11-12 06:14:02,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:02,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:02,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:02,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:02,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,748 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,760 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:14:02,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,764 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,775 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,776 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:02,782 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:02,782 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:02,782 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:02,782 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (1/1) ... [2024-11-12 06:14:02,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:02,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:02,810 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:14:02,815 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:14:02,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 06:14:02,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:02,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:02,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:02,921 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:03,069 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:03,070 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:03,081 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:03,082 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:03,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:03 BoogieIcfgContainer [2024-11-12 06:14:03,083 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:03,085 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:03,085 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:03,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:03,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:02" (1/3) ... [2024-11-12 06:14:03,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2744108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:03, skipping insertion in model container [2024-11-12 06:14:03,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:02" (2/3) ... [2024-11-12 06:14:03,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2744108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:03, skipping insertion in model container [2024-11-12 06:14:03,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:03" (3/3) ... [2024-11-12 06:14:03,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2024-11-12 06:14:03,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:03,103 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:03,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:03,158 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;@38370590, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:03,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 06:14:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 06:14:03,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:03,173 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,174 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:03,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash -207245000, now seen corresponding path program 1 times [2024-11-12 06:14:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:03,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487810557] [2024-11-12 06:14:03,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 06:14:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 06:14:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 06:14:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 06:14:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 06:14:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 06:14:03,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 06:14:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 06:14:03,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 06:14:03,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 06:14:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 06:14:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 06:14:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 06:14:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:03,429 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 06:14:03,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 06:14:03,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487810557] [2024-11-12 06:14:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487810557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:03,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:03,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:14:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537809851] [2024-11-12 06:14:03,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:03,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:14:03,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 06:14:03,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:14:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:14:03,463 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 06:14:03,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:03,484 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2024-11-12 06:14:03,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:14:03,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2024-11-12 06:14:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:03,494 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:14:03,494 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:14:03,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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:14:03,501 INFO L435 NwaCegarLoop]: 49 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, 49 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:14:03,505 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:14:03,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:14:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 06:14:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:14:03,544 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 82 [2024-11-12 06:14:03,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:03,545 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:14:03,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 06:14:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:14:03,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 06:14:03,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:03,549 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:03,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 06:14:03,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:03,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:03,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2011384006, now seen corresponding path program 1 times [2024-11-12 06:14:03,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 06:14:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964313091] [2024-11-12 06:14:03,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:03,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 06:14:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:14:03,733 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 06:14:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 06:14:03,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 06:14:03,868 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 06:14:03,869 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:03,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 06:14:03,876 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-12 06:14:03,924 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:03,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:03 BoogieIcfgContainer [2024-11-12 06:14:03,928 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:03,928 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:03,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:03,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:03,929 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:03" (3/4) ... [2024-11-12 06:14:03,932 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 06:14:03,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:03,934 INFO L158 Benchmark]: Toolchain (without parser) took 1454.33ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 119.2MB in the beginning and 221.6MB in the end (delta: -102.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:03,935 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:03,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.34ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 104.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.85ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,937 INFO L158 Benchmark]: Boogie Preprocessor took 44.72ms. Allocated memory is still 176.2MB. Free memory was 102.9MB in the beginning and 101.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,937 INFO L158 Benchmark]: RCFGBuilder took 301.27ms. Allocated memory is still 176.2MB. Free memory was 101.1MB in the beginning and 87.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,937 INFO L158 Benchmark]: TraceAbstraction took 843.20ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 86.9MB in the beginning and 222.7MB in the end (delta: -135.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:03,938 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 268.4MB. Free memory was 222.7MB in the beginning and 221.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:03,943 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.16ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.34ms. Allocated memory is still 176.2MB. Free memory was 118.8MB in the beginning and 104.9MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.85ms. Allocated memory is still 176.2MB. Free memory was 104.5MB in the beginning and 102.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.72ms. Allocated memory is still 176.2MB. Free memory was 102.9MB in the beginning and 101.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.27ms. Allocated memory is still 176.2MB. Free memory was 101.1MB in the beginning and 87.7MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 843.20ms. Allocated memory was 176.2MB in the beginning and 268.4MB in the end (delta: 92.3MB). Free memory was 86.9MB in the beginning and 222.7MB in the end (delta: -135.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 268.4MB. Free memory was 222.7MB in the beginning and 221.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 67, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 4; [L23] unsigned long int var_1_3 = 3854620897; [L24] unsigned long int var_1_4 = 1; [L25] unsigned long int var_1_5 = 5; [L26] unsigned long int var_1_6 = 1934698459; [L27] unsigned long int var_1_7 = 1000000000; [L28] unsigned long int var_1_8 = 0; [L29] unsigned long int var_1_9 = 16; [L30] double var_1_10 = 31.375; [L31] double var_1_11 = -0.6; VAL [isInitial=0, var_1_10=251/8, var_1_1=4, var_1_3=3854620897, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L71] isInitial = 1 [L72] FCALL initially() [L73] COND TRUE 1 [L74] FCALL updateLastVariables() [L75] CALL updateVariables() [L43] var_1_3 = __VERIFIER_nondet_ulong() [L44] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L44] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L45] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=1, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L46] var_1_4 = __VERIFIER_nondet_ulong() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L48] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=5, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L49] var_1_5 = __VERIFIER_nondet_ulong() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L51] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=1934698459, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L52] var_1_6 = __VERIFIER_nondet_ulong() [L53] CALL assume_abort_if_not(var_1_6 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L53] RET assume_abort_if_not(var_1_6 >= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L54] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=1000000000, var_1_8=0, var_1_9=16] [L55] var_1_7 = __VERIFIER_nondet_ulong() [L56] CALL assume_abort_if_not(var_1_7 >= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L56] RET assume_abort_if_not(var_1_7 >= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L57] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L57] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L58] var_1_8 = __VERIFIER_nondet_ulong() [L59] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_9=16] [L59] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_9=16] [L60] CALL assume_abort_if_not(var_1_8 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L60] RET assume_abort_if_not(var_1_8 <= 536870911) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L61] var_1_11 = __VERIFIER_nondet_double() [L62] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L62] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=251/8, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=16] [L75] RET updateVariables() [L76] CALL step() [L35] var_1_9 = var_1_7 [L36] var_1_10 = var_1_11 [L37] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, stepLocal_0=-3221225473, var_1_10=9223372044370968578, var_1_11=9223372044370968578, var_1_1=4, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=-3221225473] [L38] COND TRUE stepLocal_0 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) [L39] var_1_1 = (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))) VAL [isInitial=1, var_1_10=9223372044370968578, var_1_11=9223372044370968578, var_1_1=3221225470, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=-3221225473] [L76] RET step() [L77] CALL, EXPR property() [L67-L68] return (((var_1_9 >= (var_1_3 - ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((unsigned long int) (var_1_4 + (var_1_6 - (var_1_7 - var_1_8))))) : 1) && (var_1_9 == ((unsigned long int) var_1_7))) && (var_1_10 == ((double) var_1_11)) ; VAL [\result=0, isInitial=1, var_1_10=9223372044370968578, var_1_11=9223372044370968578, var_1_1=3221225470, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=-3221225473] [L77] RET, EXPR property() [L77] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=9223372044370968578, var_1_11=9223372044370968578, var_1_1=3221225470, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=-3221225473] [L19] reach_error() VAL [isInitial=1, var_1_10=9223372044370968578, var_1_11=9223372044370968578, var_1_1=3221225470, var_1_3=9223372044370968573U, var_1_4=-2147483650, var_1_5=2147483647, var_1_6=2147483647, var_1_7=-3221225473, var_1_8=0, var_1_9=-3221225473] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 13, 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, 49 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, 49 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.1s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 312/312 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:14:03,973 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-72.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 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 06:14:05,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 06:14:05,856 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 06:14:05,860 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 06:14:05,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 06:14:05,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 06:14:05,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 06:14:05,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 06:14:05,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 06:14:05,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 06:14:05,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 06:14:05,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 06:14:05,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 06:14:05,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 06:14:05,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 06:14:05,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 06:14:05,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 06:14:05,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 06:14:05,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 06:14:05,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 06:14:05,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 06:14:05,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 06:14:05,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 06:14:05,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 06:14:05,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 06:14:05,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 06:14:05,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 06:14:05,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 06:14:05,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 06:14:05,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 06:14:05,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 06:14:05,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 06:14:05,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 06:14:05,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 06:14:05,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:05,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 06:14:05,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 06:14:05,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 06:14:05,906 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 06:14:05,906 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 06:14:05,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 06:14:05,908 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 06:14:05,908 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 06:14:05,908 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 06:14:05,908 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 -> 473c6c098417e653140bb6e4cb3c44882ec0d7e6b7ae197524bf5de6070b7483 [2024-11-12 06:14:06,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 06:14:06,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 06:14:06,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 06:14:06,207 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 06:14:06,207 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 06:14:06,208 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-72.i [2024-11-12 06:14:07,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 06:14:07,722 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 06:14:07,722 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-72.i [2024-11-12 06:14:07,732 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c207ed1a/8565e191a84c460a8b947c7b74426913/FLAGd7a4bdc96 [2024-11-12 06:14:07,753 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c207ed1a/8565e191a84c460a8b947c7b74426913 [2024-11-12 06:14:07,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 06:14:07,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 06:14:07,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:07,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 06:14:07,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 06:14:07,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:07" (1/1) ... [2024-11-12 06:14:07,765 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbc3f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:07, skipping insertion in model container [2024-11-12 06:14:07,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 06:14:07" (1/1) ... [2024-11-12 06:14:07,786 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 06:14:07,964 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-72.i[915,928] [2024-11-12 06:14:07,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:08,009 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 06:14:08,020 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-72.i[915,928] [2024-11-12 06:14:08,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 06:14:08,055 INFO L204 MainTranslator]: Completed translation [2024-11-12 06:14:08,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08 WrapperNode [2024-11-12 06:14:08,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 06:14:08,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:08,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 06:14:08,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 06:14:08,063 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:14:08" (1/1) ... [2024-11-12 06:14:08,072 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:14:08" (1/1) ... [2024-11-12 06:14:08,091 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 83 [2024-11-12 06:14:08,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 06:14:08,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 06:14:08,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 06:14:08,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 06:14:08,100 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,120 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:14:08,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,128 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 06:14:08,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 06:14:08,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 06:14:08,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 06:14:08,138 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (1/1) ... [2024-11-12 06:14:08,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 06:14:08,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 06:14:08,166 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:14:08,168 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:14:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 06:14:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 06:14:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 06:14:08,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 06:14:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 06:14:08,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 06:14:08,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 06:14:08,261 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 06:14:08,428 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-12 06:14:08,428 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 06:14:08,440 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 06:14:08,440 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 06:14:08,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:08 BoogieIcfgContainer [2024-11-12 06:14:08,440 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 06:14:08,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 06:14:08,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 06:14:08,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 06:14:08,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 06:14:07" (1/3) ... [2024-11-12 06:14:08,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66de8645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:08, skipping insertion in model container [2024-11-12 06:14:08,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 06:14:08" (2/3) ... [2024-11-12 06:14:08,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66de8645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 06:14:08, skipping insertion in model container [2024-11-12 06:14:08,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:08" (3/3) ... [2024-11-12 06:14:08,448 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-72.i [2024-11-12 06:14:08,462 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 06:14:08,462 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 06:14:08,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 06:14:08,523 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;@36d95824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 06:14:08,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 06:14:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 06:14:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 06:14:08,534 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:08,535 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:08,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:08,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:08,541 INFO L85 PathProgramCache]: Analyzing trace with hash -207245000, now seen corresponding path program 1 times [2024-11-12 06:14:08,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:08,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718731392] [2024-11-12 06:14:08,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:08,557 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:14:08,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:08,561 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:14:08,561 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:14:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:08,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 06:14:08,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-12 06:14:08,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:08,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:08,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718731392] [2024-11-12 06:14:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718731392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:08,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:08,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 06:14:08,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321149459] [2024-11-12 06:14:08,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:08,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 06:14:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:08,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 06:14:08,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 06:14:08,747 INFO L87 Difference]: Start difference. First operand has 40 states, 24 states have (on average 1.25) internal successors, (30), 25 states have internal predecessors, (30), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 06:14:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:08,767 INFO L93 Difference]: Finished difference Result 73 states and 119 transitions. [2024-11-12 06:14:08,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 06:14:08,770 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 82 [2024-11-12 06:14:08,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:08,775 INFO L225 Difference]: With dead ends: 73 [2024-11-12 06:14:08,775 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 06:14:08,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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:14:08,781 INFO L435 NwaCegarLoop]: 49 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, 49 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:14:08,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 06:14:08,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 06:14:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-12 06:14:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 06:14:08,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 49 transitions. [2024-11-12 06:14:08,826 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 49 transitions. Word has length 82 [2024-11-12 06:14:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:08,826 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 49 transitions. [2024-11-12 06:14:08,826 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, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-12 06:14:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 49 transitions. [2024-11-12 06:14:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 06:14:08,829 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:08,829 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:08,836 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-12 06:14:09,034 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:14:09,035 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:09,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash -2011384006, now seen corresponding path program 1 times [2024-11-12 06:14:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1577619579] [2024-11-12 06:14:09,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:09,037 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:14:09,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:09,039 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:14:09,040 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:14:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:09,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 06:14:09,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 06:14:09,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 06:14:09,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:09,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1577619579] [2024-11-12 06:14:09,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1577619579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 06:14:09,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 06:14:09,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 06:14:09,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85235285] [2024-11-12 06:14:09,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:09,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 06:14:09,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:09,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 06:14:09,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 06:14:09,898 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 06:14:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:11,131 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2024-11-12 06:14:11,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 06:14:11,132 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2024-11-12 06:14:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:11,134 INFO L225 Difference]: With dead ends: 79 [2024-11-12 06:14:11,135 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 06:14:11,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2024-11-12 06:14:11,136 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 60 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:11,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 198 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 06:14:11,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 06:14:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2024-11-12 06:14:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.048780487804878) internal successors, (43), 43 states have internal predecessors, (43), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 06:14:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 89 transitions. [2024-11-12 06:14:11,155 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 89 transitions. Word has length 82 [2024-11-12 06:14:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:11,155 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 89 transitions. [2024-11-12 06:14:11,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 06:14:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2024-11-12 06:14:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-12 06:14:11,157 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 06:14:11,157 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 06:14:11,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:14:11,359 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 06:14:11,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 06:14:11,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2009536964, now seen corresponding path program 1 times [2024-11-12 06:14:11,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 06:14:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291895394] [2024-11-12 06:14:11,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 06:14:11,361 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:14:11,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 06:14:11,364 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 06:14:11,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 06:14:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 06:14:11,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 06:14:11,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 06:14:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 147 proven. 6 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-11-12 06:14:12,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 06:14:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-12 06:14:13,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 06:14:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291895394] [2024-11-12 06:14:13,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291895394] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 06:14:13,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 06:14:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2024-11-12 06:14:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681361412] [2024-11-12 06:14:13,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 06:14:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 06:14:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 06:14:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 06:14:13,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-12 06:14:13,891 INFO L87 Difference]: Start difference. First operand 69 states and 89 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 06:14:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 06:14:16,402 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2024-11-12 06:14:16,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 06:14:16,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 82 [2024-11-12 06:14:16,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 06:14:16,406 INFO L225 Difference]: With dead ends: 75 [2024-11-12 06:14:16,407 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 06:14:16,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2024-11-12 06:14:16,409 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-12 06:14:16,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 155 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-12 06:14:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 06:14:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 06:14:16,412 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-12 06:14:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 06:14:16,413 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2024-11-12 06:14:16,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 06:14:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 06:14:16,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-12 06:14:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 06:14:16,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 06:14:16,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 06:14:16,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 06:14:16,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 06:14:16,620 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 06:14:16,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 06:14:21,902 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 06:14:21,912 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:14:21,913 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:14:21,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-11-12 06:14:21,917 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven [2024-11-12 06:14:21,921 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 06:14:21 BoogieIcfgContainer [2024-11-12 06:14:21,922 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 06:14:21,924 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 06:14:21,924 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 06:14:21,924 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 06:14:21,925 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 06:14:08" (3/4) ... [2024-11-12 06:14:21,927 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 06:14:21,931 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 06:14:21,934 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-12 06:14:21,936 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 06:14:21,936 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 06:14:21,936 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 06:14:22,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 06:14:22,019 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 06:14:22,019 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 06:14:22,020 INFO L158 Benchmark]: Toolchain (without parser) took 14263.65ms. Allocated memory was 75.5MB in the beginning and 136.3MB in the end (delta: 60.8MB). Free memory was 43.3MB in the beginning and 94.7MB in the end (delta: -51.4MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,021 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 06:14:22,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.22ms. Allocated memory is still 75.5MB. Free memory was 43.2MB in the beginning and 47.7MB in the end (delta: -4.5MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.21ms. Allocated memory is still 75.5MB. Free memory was 47.7MB in the beginning and 46.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,021 INFO L158 Benchmark]: Boogie Preprocessor took 44.99ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 43.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,022 INFO L158 Benchmark]: RCFGBuilder took 302.88ms. Allocated memory is still 75.5MB. Free memory was 43.6MB in the beginning and 53.8MB in the end (delta: -10.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,022 INFO L158 Benchmark]: TraceAbstraction took 13478.97ms. Allocated memory was 75.5MB in the beginning and 136.3MB in the end (delta: 60.8MB). Free memory was 53.1MB in the beginning and 100.0MB in the end (delta: -46.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,022 INFO L158 Benchmark]: Witness Printer took 95.53ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 94.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 06:14:22,023 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.22ms. Allocated memory is still 75.5MB. Free memory was 43.2MB in the beginning and 47.7MB in the end (delta: -4.5MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.21ms. Allocated memory is still 75.5MB. Free memory was 47.7MB in the beginning and 46.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.99ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 43.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 302.88ms. Allocated memory is still 75.5MB. Free memory was 43.6MB in the beginning and 53.8MB in the end (delta: -10.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13478.97ms. Allocated memory was 75.5MB in the beginning and 136.3MB in the end (delta: 60.8MB). Free memory was 53.1MB in the beginning and 100.0MB in the end (delta: -46.9MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Witness Printer took 95.53ms. Allocated memory is still 136.3MB. Free memory was 100.0MB in the beginning and 94.7MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 402 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 73 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 374 IncrementalHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 73 mSolverCounterUnsat, 136 mSDtfsCounter, 374 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=2, InterpolantAutomatonStates: 30, 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, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 324 ConstructedInterpolants, 5 QuantifiedInterpolants, 1405 SizeOfPredicates, 29 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1242/1248 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: 73]: Loop Invariant Derived loop invariant: null - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_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))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-12 06:14:22,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE