./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-99.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-99.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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:22:14,309 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:22:14,380 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:22:14,388 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:22:14,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:22:14,425 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:22:14,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:22:14,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:22:14,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:22:14,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:22:14,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:22:14,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:22:14,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:22:14,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:22:14,434 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:22:14,435 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:22:14,435 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:22:14,435 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:22:14,436 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:22:14,436 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:22:14,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:22:14,437 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:22:14,437 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:22:14,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:22:14,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:22:14,438 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:22:14,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:22:14,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:22:14,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:22:14,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:22:14,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:22:14,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:22:14,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:22:14,460 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:22:14,460 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:22:14,460 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:22:14,461 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:22:14,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:22:14,461 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:22:14,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:22:14,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:22:14,462 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:22:14,462 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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2024-10-11 12:22:14,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:22:14,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:22:14,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:22:14,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:22:14,798 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:22:14,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2024-10-11 12:22:16,373 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:22:16,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:22:16,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2024-10-11 12:22:16,585 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bb930f893/be673e0465834e89a70b647d1abe5ba1/FLAG26f8857c6 [2024-10-11 12:22:16,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bb930f893/be673e0465834e89a70b647d1abe5ba1 [2024-10-11 12:22:16,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:22:16,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:22:16,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:22:16,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:22:16,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:22:16,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:16" (1/1) ... [2024-10-11 12:22:16,988 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372d0408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:16, skipping insertion in model container [2024-10-11 12:22:16,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:16" (1/1) ... [2024-10-11 12:22:17,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:22:17,178 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-99.i[915,928] [2024-10-11 12:22:17,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:22:17,232 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:22:17,245 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-99.i[915,928] [2024-10-11 12:22:17,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:22:17,279 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:22:17,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17 WrapperNode [2024-10-11 12:22:17,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:22:17,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:22:17,281 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:22:17,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:22:17,288 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:22:17" (1/1) ... [2024-10-11 12:22:17,296 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:22:17" (1/1) ... [2024-10-11 12:22:17,323 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-10-11 12:22:17,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:22:17,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:22:17,325 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:22:17,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:22:17,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,346 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,360 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:22:17,360 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:22:17,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:22:17,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:22:17,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:22:17,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (1/1) ... [2024-10-11 12:22:17,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:22:17,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:22:17,433 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:22:17,438 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:22:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:22:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:22:17,486 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:22:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:22:17,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:22:17,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:22:17,592 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:22:17,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:22:17,919 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:22:17,920 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:22:17,985 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:22:17,985 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:22:17,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:17 BoogieIcfgContainer [2024-10-11 12:22:17,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:22:17,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:22:17,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:22:17,992 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:22:17,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:22:16" (1/3) ... [2024-10-11 12:22:17,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2355ed0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:17, skipping insertion in model container [2024-10-11 12:22:17,994 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:17" (2/3) ... [2024-10-11 12:22:17,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2355ed0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:17, skipping insertion in model container [2024-10-11 12:22:17,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:17" (3/3) ... [2024-10-11 12:22:17,997 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2024-10-11 12:22:18,013 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:22:18,014 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:22:18,090 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:22:18,096 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;@25fa619b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:22:18,096 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:22:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:22:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:22:18,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:18,117 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:22:18,118 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:18,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1413437926, now seen corresponding path program 1 times [2024-10-11 12:22:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:22:18,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693012304] [2024-10-11 12:22:18,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:18,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:22:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:22:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:22:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:22:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:22:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:22:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:22:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:22:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:22:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:22:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:22:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:22:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:22:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:22:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:22:18,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:22:18,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693012304] [2024-10-11 12:22:18,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693012304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:22:18,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:22:18,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:22:18,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836327932] [2024-10-11 12:22:18,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:18,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:22:18,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:22:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:22:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:22:18,502 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:22:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:22:18,539 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2024-10-11 12:22:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:22:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2024-10-11 12:22:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:22:18,552 INFO L225 Difference]: With dead ends: 67 [2024-10-11 12:22:18,552 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 12:22:18,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:22:18,561 INFO L432 NwaCegarLoop]: 43 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, 43 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:22:18,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:22:18,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 12:22:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 12:22:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:22:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-11 12:22:18,603 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 79 [2024-10-11 12:22:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:22:18,603 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-11 12:22:18,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:22:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-11 12:22:18,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:22:18,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:18,606 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:22:18,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:22:18,607 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:18,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:18,608 INFO L85 PathProgramCache]: Analyzing trace with hash -946754132, now seen corresponding path program 1 times [2024-10-11 12:22:18,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:22:18,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252986654] [2024-10-11 12:22:18,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:18,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:22:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:22:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:22:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 12:22:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 12:22:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 12:22:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 12:22:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 12:22:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 12:22:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 12:22:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 12:22:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 12:22:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 12:22:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 12:22:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:22:19,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:22:19,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252986654] [2024-10-11 12:22:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252986654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:22:19,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:22:19,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 12:22:19,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579999331] [2024-10-11 12:22:19,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:19,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:22:19,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:22:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:22:19,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 12:22:19,664 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:22:19,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:22:19,911 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-10-11 12:22:19,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:22:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 79 [2024-10-11 12:22:19,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:22:19,913 INFO L225 Difference]: With dead ends: 53 [2024-10-11 12:22:19,913 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 12:22:19,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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:22:19,915 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:22:19,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 118 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:22:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 12:22:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-11 12:22:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:22:19,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-10-11 12:22:19,954 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 79 [2024-10-11 12:22:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:22:19,955 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-10-11 12:22:19,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:22:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-10-11 12:22:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:22:19,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:19,962 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:22:19,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:22:19,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:19,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:19,963 INFO L85 PathProgramCache]: Analyzing trace with hash -946694550, now seen corresponding path program 1 times [2024-10-11 12:22:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:22:19,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842534991] [2024-10-11 12:22:19,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:19,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:22:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:22:20,045 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 12:22:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 12:22:20,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 12:22:20,118 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 12:22:20,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:22:20,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:22:20,124 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:22:20,188 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:22:20,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:22:20 BoogieIcfgContainer [2024-10-11 12:22:20,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:22:20,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:22:20,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:22:20,193 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:22:20,193 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:17" (3/4) ... [2024-10-11 12:22:20,195 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 12:22:20,197 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:22:20,198 INFO L158 Benchmark]: Toolchain (without parser) took 3218.80ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 146.4MB in the beginning and 115.8MB in the end (delta: 30.6MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-10-11 12:22:20,198 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 174.1MB. Free memory was 142.4MB in the beginning and 142.2MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:22:20,199 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.64ms. Allocated memory is still 174.1MB. Free memory was 146.4MB in the beginning and 133.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:22:20,199 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.40ms. Allocated memory is still 174.1MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:22:20,199 INFO L158 Benchmark]: Boogie Preprocessor took 51.14ms. Allocated memory is still 174.1MB. Free memory was 130.9MB in the beginning and 128.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:22:20,200 INFO L158 Benchmark]: RCFGBuilder took 608.67ms. Allocated memory is still 174.1MB. Free memory was 128.4MB in the beginning and 133.2MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 12:22:20,204 INFO L158 Benchmark]: TraceAbstraction took 2203.77ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 133.2MB in the beginning and 116.8MB in the end (delta: 16.3MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. [2024-10-11 12:22:20,205 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 209.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:22:20,207 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.13ms. Allocated memory is still 174.1MB. Free memory was 142.4MB in the beginning and 142.2MB in the end (delta: 184.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.64ms. Allocated memory is still 174.1MB. Free memory was 146.4MB in the beginning and 133.0MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.40ms. Allocated memory is still 174.1MB. Free memory was 133.0MB in the beginning and 130.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.14ms. Allocated memory is still 174.1MB. Free memory was 130.9MB in the beginning and 128.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 608.67ms. Allocated memory is still 174.1MB. Free memory was 128.4MB in the beginning and 133.2MB in the end (delta: -4.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2203.77ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 133.2MB in the beginning and 116.8MB in the end (delta: 16.3MB). Peak memory consumption was 54.7MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 209.7MB. Free memory is still 115.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 68. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 3.25; [L24] double var_1_3 = 32.75; [L25] double var_1_4 = 128.75; [L26] unsigned char var_1_6 = 32; [L27] unsigned char var_1_7 = 32; [L28] unsigned char var_1_8 = 16; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] signed short int var_1_12 = 10; [L72] isInitial = 1 [L73] FCALL initially() [L74] COND TRUE 1 [L75] FCALL updateLastVariables() [L76] CALL updateVariables() [L43] var_1_2 = __VERIFIER_nondet_double() [L44] 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_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L44] 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_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_3=131/4, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L45] var_1_3 = __VERIFIER_nondet_double() [L46] CALL assume_abort_if_not((var_1_3 >= 0.0F && 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_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L46] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_4=515/4, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L47] var_1_4 = __VERIFIER_nondet_double() [L48] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L48] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=32, var_1_7=32, var_1_8=16, var_1_9=0] [L49] var_1_6 = __VERIFIER_nondet_uchar() [L50] CALL assume_abort_if_not(var_1_6 >= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=32, var_1_8=16, var_1_9=0] [L50] RET assume_abort_if_not(var_1_6 >= 31) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=32, var_1_8=16, var_1_9=0] [L51] CALL assume_abort_if_not(var_1_6 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=32, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=32, var_1_8=16, var_1_9=0] [L51] RET assume_abort_if_not(var_1_6 <= 64) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=32, var_1_8=16, var_1_9=0] [L52] var_1_7 = __VERIFIER_nondet_uchar() [L53] CALL assume_abort_if_not(var_1_7 >= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=16, var_1_9=0] [L53] RET assume_abort_if_not(var_1_7 >= 32) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=16, var_1_9=0] [L54] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=16, var_1_9=0] [L54] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=16, var_1_9=0] [L55] var_1_8 = __VERIFIER_nondet_uchar() [L56] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_9=0] [L56] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_9=0] [L57] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L57] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L58] var_1_9 = __VERIFIER_nondet_uchar() [L59] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0] [L59] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0] [L60] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L60] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L61] var_1_11 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L62] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L63] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L63] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L76] RET updateVariables() [L77] CALL step() [L36] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L37] COND FALSE !((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=10, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L40] var_1_12 = var_1_1 [L77] RET step() [L78] CALL, EXPR property() [L68-L69] return ((((var_1_2 <= (var_1_3 - var_1_4)) && var_1_10) ? (var_1_1 == ((unsigned char) (((var_1_6 + var_1_7) - var_1_8) + var_1_9))) : 1) && (var_1_10 == ((unsigned char) var_1_11))) && (var_1_12 == ((signed short int) var_1_1)) ; [L78] RET, EXPR property() [L78] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=-255, var_1_11=-255, var_1_12=1, var_1_1=1, var_1_6=64, var_1_7=63, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 161 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 66 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 95 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 624/624 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:22:20,244 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-99.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 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 12:22:22,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:22:22,595 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:22:22,603 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:22:22,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:22:22,641 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:22:22,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:22:22,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:22:22,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:22:22,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:22:22,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:22:22,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:22:22,646 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:22:22,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:22:22,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:22:22,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:22:22,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:22:22,652 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:22:22,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:22:22,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:22:22,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:22:22,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:22:22,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:22:22,653 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 12:22:22,654 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 12:22:22,654 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:22:22,654 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 12:22:22,654 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:22:22,654 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:22:22,655 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:22:22,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:22:22,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:22:22,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:22:22,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:22:22,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:22:22,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:22:22,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:22:22,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:22:22,659 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 12:22:22,659 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 12:22:22,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:22:22,660 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:22:22,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:22:22,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:22:22,660 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 12:22:22,660 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 -> 573cbc57cae1350f9d2f59bf5c5a92b8e982a601942d1fa1ee0f6a2a387b8d33 [2024-10-11 12:22:23,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:22:23,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:22:23,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:22:23,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:22:23,038 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:22:23,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2024-10-11 12:22:24,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:22:24,940 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:22:24,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-99.i [2024-10-11 12:22:24,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26ad708c2/04cafceb3e6447d59d248214c16ec8df/FLAG499daa04e [2024-10-11 12:22:25,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/26ad708c2/04cafceb3e6447d59d248214c16ec8df [2024-10-11 12:22:25,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:22:25,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:22:25,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:22:25,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:22:25,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:22:25,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,294 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cdc0e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25, skipping insertion in model container [2024-10-11 12:22:25,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,321 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:22:25,520 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-99.i[915,928] [2024-10-11 12:22:25,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:22:25,591 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:22:25,607 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-99.i[915,928] [2024-10-11 12:22:25,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:22:25,684 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:22:25,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25 WrapperNode [2024-10-11 12:22:25,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:22:25,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:22:25,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:22:25,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:22:25,697 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:22:25" (1/1) ... [2024-10-11 12:22:25,709 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:22:25" (1/1) ... [2024-10-11 12:22:25,736 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2024-10-11 12:22:25,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:22:25,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:22:25,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:22:25,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:22:25,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,787 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:22:25,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,805 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:22:25,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:22:25,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:22:25,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:22:25,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (1/1) ... [2024-10-11 12:22:25,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:22:25,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:22:25,857 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:22:25,861 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:22:25,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:22:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 12:22:25,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:22:25,913 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:22:25,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:22:25,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:22:26,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:22:26,009 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:22:26,490 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:22:26,491 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:22:26,587 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:22:26,587 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:22:26,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:26 BoogieIcfgContainer [2024-10-11 12:22:26,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:22:26,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:22:26,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:22:26,594 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:22:26,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:22:25" (1/3) ... [2024-10-11 12:22:26,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eddc619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:26, skipping insertion in model container [2024-10-11 12:22:26,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:22:25" (2/3) ... [2024-10-11 12:22:26,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eddc619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:22:26, skipping insertion in model container [2024-10-11 12:22:26,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:26" (3/3) ... [2024-10-11 12:22:26,597 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-99.i [2024-10-11 12:22:26,615 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:22:26,615 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:22:26,694 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:22:26,702 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;@3856a090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:22:26,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:22:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:22:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:22:26,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:26,720 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:22:26,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:26,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1413437926, now seen corresponding path program 1 times [2024-10-11 12:22:26,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:22:26,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162477771] [2024-10-11 12:22:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:26,744 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:22:26,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:22:26,748 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:22:26,749 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:22:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:27,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 12:22:27,061 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:22:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2024-10-11 12:22:27,096 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:22:27,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:22:27,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162477771] [2024-10-11 12:22:27,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162477771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:22:27,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:22:27,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:22:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711370958] [2024-10-11 12:22:27,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:27,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:22:27,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:22:27,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:22:27,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:22:27,132 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:22:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:22:27,362 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2024-10-11 12:22:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:22:27,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2024-10-11 12:22:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:22:27,390 INFO L225 Difference]: With dead ends: 67 [2024-10-11 12:22:27,390 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 12:22:27,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 78 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:22:27,401 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:22:27,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:22:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 12:22:27,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 12:22:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 12:22:27,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2024-10-11 12:22:27,450 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 79 [2024-10-11 12:22:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:22:27,451 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2024-10-11 12:22:27,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:22:27,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2024-10-11 12:22:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:22:27,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:27,456 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:22:27,465 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 (2)] Forceful destruction successful, exit code 0 [2024-10-11 12:22:27,657 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:22:27,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:27,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash -946754132, now seen corresponding path program 1 times [2024-10-11 12:22:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:22:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255728148] [2024-10-11 12:22:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:27,660 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:22:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:22:27,664 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:22:27,666 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:22:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:27,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 12:22:27,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:22:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 228 proven. 63 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-11 12:22:29,725 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:22:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-11 12:22:30,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:22:30,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255728148] [2024-10-11 12:22:30,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255728148] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 12:22:30,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 12:22:30,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [23] total 26 [2024-10-11 12:22:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681670910] [2024-10-11 12:22:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:30,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 12:22:30,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:22:30,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 12:22:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-10-11 12:22:30,247 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:22:31,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:22:31,146 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2024-10-11 12:22:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:22:31,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 79 [2024-10-11 12:22:31,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:22:31,149 INFO L225 Difference]: With dead ends: 53 [2024-10-11 12:22:31,149 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 12:22:31,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2024-10-11 12:22:31,153 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 12:22:31,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 118 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 12:22:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 12:22:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-11 12:22:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 12:22:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-10-11 12:22:31,175 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 79 [2024-10-11 12:22:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:22:31,175 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-10-11 12:22:31,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-11 12:22:31,176 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-10-11 12:22:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 12:22:31,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:22:31,178 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:22:31,190 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 (3)] Ended with exit code 0 [2024-10-11 12:22:31,381 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:22:31,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:22:31,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:22:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash -946694550, now seen corresponding path program 1 times [2024-10-11 12:22:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 12:22:31,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138923998] [2024-10-11 12:22:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:22:31,385 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:22:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 12:22:31,394 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:22:31,398 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:22:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:22:31,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 12:22:31,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:22:33,801 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-10-11 12:22:33,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 12:22:33,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 12:22:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138923998] [2024-10-11 12:22:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138923998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:22:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:22:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 12:22:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070130326] [2024-10-11 12:22:33,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:22:33,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 12:22:33,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 12:22:33,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 12:22:33,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 12:22:33,810 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:22:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:22:39,196 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-10-11 12:22:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 12:22:39,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 79 [2024-10-11 12:22:39,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:22:39,209 INFO L225 Difference]: With dead ends: 56 [2024-10-11 12:22:39,209 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:22:39,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:22:39,211 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 12:22:39,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 100 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 12:22:39,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:22:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:22:39,213 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:22:39,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:22:39,213 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 79 [2024-10-11 12:22:39,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:22:39,213 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:22:39,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 12:22:39,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:22:39,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:22:39,217 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:22:39,226 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 (4)] Ended with exit code 0 [2024-10-11 12:22:39,418 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:22:39,422 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 12:22:39,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:22:42,452 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:22:42,466 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: currentRoundingMode [2024-10-11 12:22:42,468 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-11 12:22:42,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:22:42 BoogieIcfgContainer [2024-10-11 12:22:42,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:22:42,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:22:42,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:22:42,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:22:42,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:22:26" (3/4) ... [2024-10-11 12:22:42,482 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:22:42,488 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:22:42,494 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-10-11 12:22:42,496 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-10-11 12:22:42,496 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:22:42,497 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:22:42,609 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:22:42,610 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:22:42,610 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:22:42,611 INFO L158 Benchmark]: Toolchain (without parser) took 17323.76ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 42.7MB in the beginning and 51.2MB in the end (delta: -8.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,611 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory is still 24.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:22:42,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 400.03ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 50.2MB in the end (delta: -7.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.14ms. Allocated memory is still 71.3MB. Free memory was 50.2MB in the beginning and 48.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,612 INFO L158 Benchmark]: Boogie Preprocessor took 74.75ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 45.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,613 INFO L158 Benchmark]: RCFGBuilder took 770.43ms. Allocated memory is still 71.3MB. Free memory was 45.8MB in the beginning and 48.6MB in the end (delta: -2.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,613 INFO L158 Benchmark]: TraceAbstraction took 15884.88ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 47.9MB in the beginning and 56.2MB in the end (delta: -8.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,613 INFO L158 Benchmark]: Witness Printer took 134.78ms. Allocated memory is still 94.4MB. Free memory was 56.2MB in the beginning and 51.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:22:42,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 46.1MB. Free memory is still 24.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 400.03ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 50.2MB in the end (delta: -7.7MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.14ms. Allocated memory is still 71.3MB. Free memory was 50.2MB in the beginning and 48.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.75ms. Allocated memory is still 71.3MB. Free memory was 48.2MB in the beginning and 45.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 770.43ms. Allocated memory is still 71.3MB. Free memory was 45.8MB in the beginning and 48.6MB in the end (delta: -2.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15884.88ms. Allocated memory was 71.3MB in the beginning and 94.4MB in the end (delta: 23.1MB). Free memory was 47.9MB in the beginning and 56.2MB in the end (delta: -8.4MB). Peak memory consumption was 24.4MB. Max. memory is 16.1GB. * Witness Printer took 134.78ms. Allocated memory is still 94.4MB. Free memory was 56.2MB in the beginning and 51.2MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: currentRoundingMode - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression * 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 3, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 106 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 141 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 288 IncrementalHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 120 mSDtfsCounter, 288 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=2, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1361 SizeOfPredicates, 28 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1185/1248 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((var_1_11 >= 1) && (var_1_11 <= 1)) && (var_1_11 == var_1_10)) || (((var_1_11 >= 1) && (var_1_11 <= 1)) && (var_1_11 == var_1_10))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (0 != cond) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:22:42,657 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