./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:19:17,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:19:17,993 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:19:18,002 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:19:18,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:19:18,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:19:18,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:19:18,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:19:18,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:19:18,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:19:18,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:19:18,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:19:18,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:19:18,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:19:18,045 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:19:18,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:19:18,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:19:18,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:19:18,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:19:18,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:19:18,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:19:18,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:19:18,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:19:18,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:19:18,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:19:18,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:19:18,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:19:18,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:19:18,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:19:18,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:19:18,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:19:18,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:19:18,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:18,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:19:18,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:19:18,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:19:18,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:19:18,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:19:18,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:19:18,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:19:18,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:19:18,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:19:18,057 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-clean/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-clean/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 -> 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc [2024-10-11 12:19:18,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:19:18,368 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:19:18,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:19:18,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:19:18,380 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:19:18,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-10-11 12:19:19,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:19:20,150 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:19:20,151 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-10-11 12:19:20,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/149afc752/5a03993666a44e098752951651c7c7b7/FLAG329b5d912 [2024-10-11 12:19:20,528 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/149afc752/5a03993666a44e098752951651c7c7b7 [2024-10-11 12:19:20,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:19:20,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:19:20,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:20,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:19:20,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:19:20,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1328a9f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20, skipping insertion in model container [2024-10-11 12:19:20,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:19:20,712 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i[915,928] [2024-10-11 12:19:20,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:20,762 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:19:20,772 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i[915,928] [2024-10-11 12:19:20,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:20,802 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:19:20,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20 WrapperNode [2024-10-11 12:19:20,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:20,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:20,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:19:20,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:19:20,811 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,848 INFO L138 Inliner]: procedures = 26, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-10-11 12:19:20,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:20,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:19:20,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:19:20,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:19:20,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,882 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:19:20,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,894 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:19:20,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:19:20,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:19:20,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:19:20,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (1/1) ... [2024-10-11 12:19:20,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:20,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:19:20,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:19:20,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:19:21,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:19:21,009 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:19:21,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:19:21,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:19:21,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:19:21,009 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:19:21,089 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:19:21,091 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:19:21,327 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:19:21,328 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:19:21,382 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:19:21,383 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:19:21,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:21 BoogieIcfgContainer [2024-10-11 12:19:21,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:19:21,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:19:21,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:19:21,388 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:19:21,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:19:20" (1/3) ... [2024-10-11 12:19:21,389 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67059452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:21, skipping insertion in model container [2024-10-11 12:19:21,389 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:20" (2/3) ... [2024-10-11 12:19:21,390 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67059452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:21, skipping insertion in model container [2024-10-11 12:19:21,390 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:21" (3/3) ... [2024-10-11 12:19:21,392 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-34.i [2024-10-11 12:19:21,406 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:19:21,406 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:19:21,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:19:21,469 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;@6db8e8f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:19:21,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:19:21,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 12:19:21,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 12:19:21,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:21,485 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:21,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:21,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:21,492 INFO L85 PathProgramCache]: Analyzing trace with hash -472059257, now seen corresponding path program 1 times [2024-10-11 12:19:21,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:19:21,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010530072] [2024-10-11 12:19:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:19:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:19:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:19:21,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:19:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:19:21,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:19:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:19:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:19:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:19:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:21,933 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 12:19:21,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:19:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010530072] [2024-10-11 12:19:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010530072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:21,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:21,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:19:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086459146] [2024-10-11 12:19:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:21,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:19:21,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:19:21,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:19:21,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:21,974 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 12:19:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:22,012 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2024-10-11 12:19:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:19:22,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-10-11 12:19:22,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:22,023 INFO L225 Difference]: With dead ends: 53 [2024-10-11 12:19:22,023 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 12:19:22,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:22,034 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:22,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:19:22,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 12:19:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 12:19:22,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 12:19:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-11 12:19:22,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 51 [2024-10-11 12:19:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:22,074 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-11 12:19:22,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 12:19:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-10-11 12:19:22,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 12:19:22,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:22,077 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:22,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:19:22,078 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:22,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:22,078 INFO L85 PathProgramCache]: Analyzing trace with hash -147016757, now seen corresponding path program 1 times [2024-10-11 12:19:22,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:19:22,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984778110] [2024-10-11 12:19:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:22,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:19:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:19:22,166 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:19:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:19:22,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:19:22,258 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:19:22,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:19:22,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:19:22,268 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 12:19:22,300 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:19:22,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:19:22 BoogieIcfgContainer [2024-10-11 12:19:22,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:19:22,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:19:22,305 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:19:22,305 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:19:22,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:21" (3/4) ... [2024-10-11 12:19:22,307 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:19:22,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:19:22,309 INFO L158 Benchmark]: Toolchain (without parser) took 1776.03ms. Allocated memory is still 153.1MB. Free memory was 116.6MB in the beginning and 100.1MB in the end (delta: 16.5MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-10-11 12:19:22,309 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:22,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.12ms. Allocated memory is still 153.1MB. Free memory was 116.1MB in the beginning and 103.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:19:22,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.45ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 100.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:19:22,310 INFO L158 Benchmark]: Boogie Preprocessor took 47.79ms. Allocated memory is still 153.1MB. Free memory was 100.8MB in the beginning and 97.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:19:22,312 INFO L158 Benchmark]: RCFGBuilder took 485.51ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 82.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:19:22,313 INFO L158 Benchmark]: TraceAbstraction took 918.52ms. Allocated memory is still 153.1MB. Free memory was 81.5MB in the beginning and 100.1MB in the end (delta: -18.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:22,313 INFO L158 Benchmark]: Witness Printer took 3.45ms. Allocated memory is still 153.1MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:22,315 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 117.4MB. Free memory is still 92.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.12ms. Allocated memory is still 153.1MB. Free memory was 116.1MB in the beginning and 103.3MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.45ms. Allocated memory is still 153.1MB. Free memory was 103.3MB in the beginning and 100.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.79ms. Allocated memory is still 153.1MB. Free memory was 100.8MB in the beginning and 97.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 485.51ms. Allocated memory is still 153.1MB. Free memory was 97.2MB in the beginning and 82.0MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 918.52ms. Allocated memory is still 153.1MB. Free memory was 81.5MB in the beginning and 100.1MB in the end (delta: -18.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.45ms. Allocated memory is still 153.1MB. Free memory is still 100.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] double var_1_2 = 4.4; [L24] double var_1_3 = 16.475; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 5; [L63] isInitial = 1 [L64] FCALL initially() [L65] COND TRUE 1 [L66] FCALL updateLastVariables() [L67] CALL updateVariables() [L42] var_1_2 = __VERIFIER_nondet_double() [L43] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L43] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=16, var_1_3=659/40, var_1_4=1, var_1_5=2, var_1_6=5] [L44] var_1_3 = __VERIFIER_nondet_double() [L45] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L45] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L46] var_1_4 = __VERIFIER_nondet_uchar() [L47] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_5=2, var_1_6=5] [L47] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=16, var_1_5=2, var_1_6=5] [L48] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L48] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_1=16, var_1_4=1, var_1_5=2, var_1_6=5] [L49] var_1_5 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_6=5] [L50] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=16, var_1_4=1, var_1_6=5] [L51] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230, var_1_6=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230, var_1_6=5] [L51] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230, var_1_6=5] [L52] var_1_6 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230] [L53] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230] [L54] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230, var_1_6=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230, var_1_6=8] [L54] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, var_1_1=16, var_1_4=1, var_1_5=-230, var_1_6=8] [L67] RET updateVariables() [L68] CALL step() [L31] COND FALSE !(var_1_2 > (- var_1_3)) [L38] var_1_1 = var_1_5 VAL [isInitial=1, var_1_1=-230, var_1_4=1, var_1_5=-230, var_1_6=8] [L68] RET step() [L69] CALL, EXPR property() [L59-L60] return (var_1_2 > (- var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned char) ((((var_1_5) < (((((25) > (((((var_1_6) < (8)) ? (var_1_6) : (8))))) ? (25) : (((((var_1_6) < (8)) ? (var_1_6) : (8)))))))) ? (var_1_5) : (((((25) > (((((var_1_6) < (8)) ? (var_1_6) : (8))))) ? (25) : (((((var_1_6) < (8)) ? (var_1_6) : (8))))))))))) : (var_1_1 == ((unsigned char) var_1_6))) : (var_1_1 == ((unsigned char) var_1_5)) ; [L69] RET, EXPR property() [L69] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=-230, var_1_4=1, var_1_5=-230, var_1_6=8] [L19] reach_error() VAL [isInitial=1, var_1_1=-230, var_1_4=1, var_1_5=-230, var_1_6=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 2, TraceHistogramMax: 8, 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, 32 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 50 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 112/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 12:19:22,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:19:24,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:19:24,791 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 12:19:24,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:19:24,798 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:19:24,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:19:24,837 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:19:24,838 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:19:24,839 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:19:24,839 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:19:24,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:19:24,840 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:19:24,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:19:24,842 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:19:24,843 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:19:24,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:19:24,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:19:24,845 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:19:24,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:19:24,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:19:24,850 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:19:24,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:19:24,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:19:24,851 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:19:24,851 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:19:24,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:19:24,851 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:19:24,852 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:19:24,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:19:24,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:19:24,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:19:24,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:19:24,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:19:24,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:19:24,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:24,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:19:24,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:19:24,857 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:19:24,857 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:19:24,857 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:19:24,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:19:24,858 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:19:24,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:19:24,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:19:24,859 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:19:24,859 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-clean/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-clean/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 -> 5ba331e7382548a714447aae24dc39067b99d6e58e7280c88c6b71afa304f6fc [2024-10-11 12:19:25,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:19:25,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:19:25,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:19:25,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:19:25,276 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:19:25,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-10-11 12:19:26,987 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:19:27,213 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:19:27,214 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i [2024-10-11 12:19:27,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ee771e2d/1147001423f74724ad536271743c24c1/FLAGfafbff47a [2024-10-11 12:19:27,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0ee771e2d/1147001423f74724ad536271743c24c1 [2024-10-11 12:19:27,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:19:27,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:19:27,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:27,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:19:27,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:19:27,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:27,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27, skipping insertion in model container [2024-10-11 12:19:27,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:27,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:19:27,800 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i[915,928] [2024-10-11 12:19:27,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:27,881 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:19:27,896 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-34.i[915,928] [2024-10-11 12:19:27,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:19:27,941 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:19:27,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27 WrapperNode [2024-10-11 12:19:27,942 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:19:27,943 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:27,943 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:19:27,943 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:19:27,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:27,966 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,001 INFO L138 Inliner]: procedures = 27, calls = 21, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 68 [2024-10-11 12:19:28,002 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:19:28,005 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:19:28,005 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:19:28,005 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:19:28,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,024 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,042 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 12:19:28,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,063 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,070 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,077 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:19:28,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:19:28,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:19:28,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:19:28,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (1/1) ... [2024-10-11 12:19:28,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:19:28,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:19:28,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:19:28,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:19:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:19:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:19:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:19:28,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:19:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:19:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:19:28,260 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:19:28,263 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:19:28,483 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:19:28,483 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:19:28,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:19:28,528 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:19:28,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:28 BoogieIcfgContainer [2024-10-11 12:19:28,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:19:28,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:19:28,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:19:28,535 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:19:28,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:19:27" (1/3) ... [2024-10-11 12:19:28,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc9b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:28, skipping insertion in model container [2024-10-11 12:19:28,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:19:27" (2/3) ... [2024-10-11 12:19:28,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc9b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:19:28, skipping insertion in model container [2024-10-11 12:19:28,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:28" (3/3) ... [2024-10-11 12:19:28,540 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-34.i [2024-10-11 12:19:28,558 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:19:28,559 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:19:28,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:19:28,660 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;@30f5cabf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:19:28,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:19:28,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 12:19:28,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 12:19:28,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:28,672 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:28,673 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:28,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:28,678 INFO L85 PathProgramCache]: Analyzing trace with hash -472059257, now seen corresponding path program 1 times [2024-10-11 12:19:28,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:28,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529027634] [2024-10-11 12:19:28,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:28,694 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:28,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:28,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 12:19:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:28,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:19:28,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-11 12:19:28,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:19:28,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:28,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529027634] [2024-10-11 12:19:28,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [529027634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:28,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:28,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:19:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534797404] [2024-10-11 12:19:28,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:28,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:19:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:28,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:19:28,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:28,941 INFO L87 Difference]: Start difference. First operand has 28 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 12:19:28,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:28,984 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2024-10-11 12:19:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:19:28,988 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2024-10-11 12:19:28,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:28,994 INFO L225 Difference]: With dead ends: 53 [2024-10-11 12:19:28,995 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 12:19:28,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:19:29,002 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:29,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:19:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 12:19:29,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-10-11 12:19:29,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 12:19:29,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2024-10-11 12:19:29,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 51 [2024-10-11 12:19:29,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:29,039 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2024-10-11 12:19:29,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 12:19:29,040 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2024-10-11 12:19:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-11 12:19:29,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:29,042 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:29,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 12:19:29,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:29,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:29,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:29,247 INFO L85 PathProgramCache]: Analyzing trace with hash -147016757, now seen corresponding path program 1 times [2024-10-11 12:19:29,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:29,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217090634] [2024-10-11 12:19:29,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:29,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:29,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:29,251 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:29,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 12:19:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:29,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 12:19:29,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 12:19:36,774 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:19:36,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217090634] [2024-10-11 12:19:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217090634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:19:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955741120] [2024-10-11 12:19:36,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:36,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:19:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:19:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:19:36,779 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 12:19:36,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:36,886 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2024-10-11 12:19:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:19:36,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 51 [2024-10-11 12:19:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:36,889 INFO L225 Difference]: With dead ends: 32 [2024-10-11 12:19:36,889 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 12:19:36,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:19:36,890 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:36,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:19:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 12:19:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2024-10-11 12:19:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 12:19:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-10-11 12:19:36,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 51 [2024-10-11 12:19:36,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:36,900 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-10-11 12:19:36,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 12:19:36,901 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-10-11 12:19:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 12:19:36,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:36,902 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:36,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:19:37,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:37,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:37,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash -271595194, now seen corresponding path program 1 times [2024-10-11 12:19:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1447738717] [2024-10-11 12:19:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:37,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:37,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:37,109 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:37,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 12:19:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:37,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:19:37,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:41,395 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 12:19:41,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:19:41,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:41,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1447738717] [2024-10-11 12:19:41,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1447738717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:41,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:41,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:19:41,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755907898] [2024-10-11 12:19:41,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:41,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:19:41,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:41,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:19:41,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:19:41,399 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 12:19:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:41,517 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-10-11 12:19:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:19:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 52 [2024-10-11 12:19:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:41,519 INFO L225 Difference]: With dead ends: 36 [2024-10-11 12:19:41,519 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 12:19:41,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:19:41,521 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 12 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:41,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:19:41,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 12:19:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2024-10-11 12:19:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 12:19:41,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2024-10-11 12:19:41,526 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 52 [2024-10-11 12:19:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:41,527 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2024-10-11 12:19:41,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 12:19:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2024-10-11 12:19:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-11 12:19:41,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:19:41,528 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:19:41,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 12:19:41,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:41,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:19:41,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:19:41,734 INFO L85 PathProgramCache]: Analyzing trace with hash -271535612, now seen corresponding path program 1 times [2024-10-11 12:19:41,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:19:41,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242205770] [2024-10-11 12:19:41,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:19:41,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:41,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:19:41,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 12:19:41,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 12:19:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:19:41,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 12:19:41,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:19:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 12:19:43,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:19:43,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:19:43,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242205770] [2024-10-11 12:19:43,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242205770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:19:43,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:19:43,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:19:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676693359] [2024-10-11 12:19:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:19:43,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:19:43,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:19:43,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:19:43,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:19:43,472 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 12:19:43,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:19:43,612 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2024-10-11 12:19:43,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:19:43,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 52 [2024-10-11 12:19:43,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:19:43,614 INFO L225 Difference]: With dead ends: 34 [2024-10-11 12:19:43,614 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:19:43,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:19:43,615 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:19:43,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 103 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:19:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:19:43,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:19:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 12:19:43,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:19:43,618 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2024-10-11 12:19:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:19:43,618 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:19:43,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 12:19:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:19:43,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:19:43,621 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:19:43,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 12:19:43,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 12:19:43,826 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 12:19:43,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:19:43,850 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:19:43,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:19:43 BoogieIcfgContainer [2024-10-11 12:19:43,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:19:43,904 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:19:43,905 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:19:43,905 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:19:43,906 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:19:28" (3/4) ... [2024-10-11 12:19:43,908 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:19:43,913 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:19:43,930 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 12:19:43,932 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 12:19:43,932 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:19:43,933 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:19:44,051 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:19:44,052 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:19:44,052 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:19:44,053 INFO L158 Benchmark]: Toolchain (without parser) took 16479.45ms. Allocated memory was 75.5MB in the beginning and 778.0MB in the end (delta: 702.5MB). Free memory was 44.6MB in the beginning and 746.9MB in the end (delta: -702.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:44,054 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:19:44,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.97ms. Allocated memory is still 75.5MB. Free memory was 44.4MB in the beginning and 52.6MB in the end (delta: -8.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-10-11 12:19:44,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.41ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 50.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:19:44,055 INFO L158 Benchmark]: Boogie Preprocessor took 72.54ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 48.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:19:44,055 INFO L158 Benchmark]: RCFGBuilder took 450.19ms. Allocated memory is still 75.5MB. Free memory was 48.4MB in the beginning and 33.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 12:19:44,056 INFO L158 Benchmark]: TraceAbstraction took 15369.99ms. Allocated memory was 75.5MB in the beginning and 778.0MB in the end (delta: 702.5MB). Free memory was 32.7MB in the beginning and 752.3MB in the end (delta: -719.7MB). Peak memory consumption was 301.8MB. Max. memory is 16.1GB. [2024-10-11 12:19:44,056 INFO L158 Benchmark]: Witness Printer took 148.28ms. Allocated memory is still 778.0MB. Free memory was 752.3MB in the beginning and 746.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:19:44,057 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.22ms. Allocated memory is still 56.6MB. Free memory was 35.3MB in the beginning and 35.3MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.97ms. Allocated memory is still 75.5MB. Free memory was 44.4MB in the beginning and 52.6MB in the end (delta: -8.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.41ms. Allocated memory is still 75.5MB. Free memory was 52.6MB in the beginning and 50.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.54ms. Allocated memory is still 75.5MB. Free memory was 50.8MB in the beginning and 48.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.19ms. Allocated memory is still 75.5MB. Free memory was 48.4MB in the beginning and 33.4MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15369.99ms. Allocated memory was 75.5MB in the beginning and 778.0MB in the end (delta: 702.5MB). Free memory was 32.7MB in the beginning and 752.3MB in the end (delta: -719.7MB). Peak memory consumption was 301.8MB. Max. memory is 16.1GB. * Witness Printer took 148.28ms. Allocated memory is still 778.0MB. Free memory was 752.3MB in the beginning and 746.9MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. 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 - 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 177 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 129 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 260 SizeOfPredicates, 18 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 448/448 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: 65]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2024-10-11 12:19:44,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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