./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:35:54,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:35:54,151 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:35:54,157 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:35:54,159 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:35:54,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:35:54,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:35:54,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:35:54,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:35:54,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:35:54,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:35:54,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:35:54,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:35:54,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:35:54,185 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:35:54,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:35:54,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:35:54,187 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:35:54,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:35:54,187 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:35:54,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:35:54,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:35:54,192 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:35:54,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:35:54,192 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:35:54,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:35:54,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:35:54,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:35:54,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:35:54,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:35:54,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:35:54,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:35:54,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:54,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:35:54,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:35:54,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:35:54,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:35:54,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:35:54,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:35:54,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:35:54,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:35:54,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:35:54,201 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2024-11-09 00:35:54,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:35:54,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:35:54,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:35:54,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:35:54,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:35:54,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-09 00:35:55,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:35:56,122 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:35:56,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-09 00:35:56,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30509c04c/3d60214659b14116a846ae5535380cbf/FLAGff3cdcffe [2024-11-09 00:35:56,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30509c04c/3d60214659b14116a846ae5535380cbf [2024-11-09 00:35:56,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:35:56,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:35:56,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:56,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:35:56,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:35:56,158 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,159 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a3205c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56, skipping insertion in model container [2024-11-09 00:35:56,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:35:56,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-09 00:35:56,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:56,397 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:35:56,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-09 00:35:56,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:35:56,473 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:35:56,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56 WrapperNode [2024-11-09 00:35:56,474 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:35:56,475 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:56,475 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:35:56,475 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:35:56,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,521 INFO L138 Inliner]: procedures = 26, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-09 00:35:56,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:35:56,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:35:56,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:35:56,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:35:56,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,540 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,560 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:35:56,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,560 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,567 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,572 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:35:56,576 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:35:56,576 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:35:56,577 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:35:56,577 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (1/1) ... [2024-11-09 00:35:56,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:35:56,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:35:56,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:35:56,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:35:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:35:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:35:56,670 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:35:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:35:56,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:35:56,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:35:56,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:35:56,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:35:56,944 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-09 00:35:56,944 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:35:56,955 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:35:56,955 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:35:56,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:56 BoogieIcfgContainer [2024-11-09 00:35:56,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:35:56,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:35:56,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:35:56,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:35:56,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:35:56" (1/3) ... [2024-11-09 00:35:56,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbfc506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:56, skipping insertion in model container [2024-11-09 00:35:56,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:56" (2/3) ... [2024-11-09 00:35:56,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbfc506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:56, skipping insertion in model container [2024-11-09 00:35:56,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:56" (3/3) ... [2024-11-09 00:35:56,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2024-11-09 00:35:56,979 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:35:56,979 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:35:57,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:35:57,038 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;@209f504a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:35:57,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:35:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 00:35:57,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:57,051 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:57,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:57,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:57,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1636704476, now seen corresponding path program 1 times [2024-11-09 00:35:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150324287] [2024-11-09 00:35:57,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:57,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:57,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:57,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150324287] [2024-11-09 00:35:57,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150324287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:57,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:57,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:35:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996710485] [2024-11-09 00:35:57,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:57,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:35:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:35:57,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:57,361 INFO L87 Difference]: Start difference. First operand has 43 states, 30 states have (on average 1.3) internal successors, (39), 31 states have internal predecessors, (39), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 00:35:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:57,386 INFO L93 Difference]: Finished difference Result 79 states and 122 transitions. [2024-11-09 00:35:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:35:57,388 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) Word has length 69 [2024-11-09 00:35:57,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:57,393 INFO L225 Difference]: With dead ends: 79 [2024-11-09 00:35:57,394 INFO L226 Difference]: Without dead ends: 39 [2024-11-09 00:35:57,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:35:57,399 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:57,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:57,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-09 00:35:57,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-09 00:35:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-09 00:35:57,436 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 69 [2024-11-09 00:35:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:57,436 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-09 00:35:57,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-09 00:35:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-09 00:35:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 00:35:57,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:57,440 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:57,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:35:57,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:57,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:57,441 INFO L85 PathProgramCache]: Analyzing trace with hash 953565284, now seen corresponding path program 1 times [2024-11-09 00:35:57,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:57,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847502810] [2024-11-09 00:35:57,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:57,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:58,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:58,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:58,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:58,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847502810] [2024-11-09 00:35:58,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847502810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:58,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:58,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:35:58,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859627072] [2024-11-09 00:35:58,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:35:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:58,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:35:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:35:58,324 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:58,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:58,427 INFO L93 Difference]: Finished difference Result 77 states and 103 transitions. [2024-11-09 00:35:58,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:35:58,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 69 [2024-11-09 00:35:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:58,432 INFO L225 Difference]: With dead ends: 77 [2024-11-09 00:35:58,432 INFO L226 Difference]: Without dead ends: 41 [2024-11-09 00:35:58,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:35:58,434 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:58,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 100 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:35:58,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-09 00:35:58,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-09 00:35:58,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-09 00:35:58,448 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 69 [2024-11-09 00:35:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-09 00:35:58,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-09 00:35:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:35:58,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:58,456 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:35:58,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:58,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash 999746527, now seen corresponding path program 1 times [2024-11-09 00:35:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750511987] [2024-11-09 00:35:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:58,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:58,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:58,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750511987] [2024-11-09 00:35:58,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750511987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:58,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:58,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:35:58,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174773150] [2024-11-09 00:35:58,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:58,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:35:58,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:58,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:35:58,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:35:58,779 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:58,863 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-11-09 00:35:58,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:35:58,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-11-09 00:35:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:58,866 INFO L225 Difference]: With dead ends: 52 [2024-11-09 00:35:58,866 INFO L226 Difference]: Without dead ends: 50 [2024-11-09 00:35:58,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:35:58,868 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:58,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 232 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-09 00:35:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2024-11-09 00:35:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 states have internal predecessors, (40), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:58,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2024-11-09 00:35:58,880 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 71 [2024-11-09 00:35:58,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:58,881 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2024-11-09 00:35:58,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:58,881 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2024-11-09 00:35:58,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 00:35:58,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:58,883 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:58,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:35:58,883 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:58,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1679804897, now seen corresponding path program 1 times [2024-11-09 00:35:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:58,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196142042] [2024-11-09 00:35:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:58,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:59,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,221 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196142042] [2024-11-09 00:35:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196142042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:59,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:35:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398014489] [2024-11-09 00:35:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:59,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:35:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:35:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:35:59,226 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:59,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:59,447 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2024-11-09 00:35:59,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:35:59,448 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 71 [2024-11-09 00:35:59,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:59,450 INFO L225 Difference]: With dead ends: 75 [2024-11-09 00:35:59,450 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 00:35:59,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 00:35:59,454 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 23 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:59,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 385 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:35:59,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 00:35:59,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-11-09 00:35:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 56 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:35:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2024-11-09 00:35:59,477 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 71 [2024-11-09 00:35:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:59,478 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2024-11-09 00:35:59,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2024-11-09 00:35:59,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:35:59,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:59,482 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:35:59,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:59,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2046630524, now seen corresponding path program 1 times [2024-11-09 00:35:59,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:59,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812275257] [2024-11-09 00:35:59,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:59,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:59,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,611 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:59,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812275257] [2024-11-09 00:35:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812275257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:35:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413469579] [2024-11-09 00:35:59,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:35:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:35:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:35:59,616 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:59,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:59,653 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2024-11-09 00:35:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:35:59,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-09 00:35:59,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:59,656 INFO L225 Difference]: With dead ends: 155 [2024-11-09 00:35:59,656 INFO L226 Difference]: Without dead ends: 88 [2024-11-09 00:35:59,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:35:59,659 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:59,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 96 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-09 00:35:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2024-11-09 00:35:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 55 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 00:35:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2024-11-09 00:35:59,669 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 72 [2024-11-09 00:35:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:59,670 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2024-11-09 00:35:59,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2024-11-09 00:35:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 00:35:59,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:59,671 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:59,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:35:59,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:59,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash 946044516, now seen corresponding path program 1 times [2024-11-09 00:35:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848983532] [2024-11-09 00:35:59,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:35:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:35:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:35:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:35:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:35:59,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:35:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:35:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:35:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:35:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:35:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:35:59,765 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:35:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:35:59,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848983532] [2024-11-09 00:35:59,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848983532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:35:59,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:35:59,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:35:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362682233] [2024-11-09 00:35:59,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:35:59,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:35:59,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:35:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:35:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:35:59,768 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:35:59,807 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2024-11-09 00:35:59,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:35:59,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2024-11-09 00:35:59,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:35:59,809 INFO L225 Difference]: With dead ends: 136 [2024-11-09 00:35:59,810 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 00:35:59,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:35:59,813 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 21 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:35:59,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:35:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 00:35:59,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2024-11-09 00:35:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:35:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2024-11-09 00:35:59,827 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 72 [2024-11-09 00:35:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:35:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2024-11-09 00:35:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:35:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2024-11-09 00:35:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-09 00:35:59,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:35:59,832 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:59,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:35:59,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:35:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:35:59,833 INFO L85 PathProgramCache]: Analyzing trace with hash 976601441, now seen corresponding path program 1 times [2024-11-09 00:35:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:35:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143608417] [2024-11-09 00:35:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:35:59,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:35:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:35:59,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:35:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:35:59,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:35:59,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:35:59,911 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:35:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:35:59,916 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:35:59,963 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:35:59,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:35:59 BoogieIcfgContainer [2024-11-09 00:35:59,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:35:59,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:35:59,967 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:35:59,967 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:35:59,967 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:56" (3/4) ... [2024-11-09 00:35:59,970 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:35:59,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:35:59,971 INFO L158 Benchmark]: Toolchain (without parser) took 3821.04ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 117.6MB in the beginning and 93.8MB in the end (delta: 23.9MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-11-09 00:35:59,971 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:59,972 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.79ms. Allocated memory is still 174.1MB. Free memory was 117.2MB in the beginning and 146.2MB in the end (delta: -29.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:35:59,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.58ms. Allocated memory is still 174.1MB. Free memory was 146.2MB in the beginning and 143.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:59,973 INFO L158 Benchmark]: Boogie Preprocessor took 49.55ms. Allocated memory is still 174.1MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:35:59,973 INFO L158 Benchmark]: RCFGBuilder took 379.53ms. Allocated memory is still 174.1MB. Free memory was 141.2MB in the beginning and 125.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:35:59,973 INFO L158 Benchmark]: TraceAbstraction took 3008.30ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 125.8MB in the beginning and 94.8MB in the end (delta: 31.0MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. [2024-11-09 00:35:59,974 INFO L158 Benchmark]: Witness Printer took 4.33ms. Allocated memory is still 209.7MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:35:59,976 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 96.5MB. Free memory is still 51.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.79ms. Allocated memory is still 174.1MB. Free memory was 117.2MB in the beginning and 146.2MB in the end (delta: -29.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.58ms. Allocated memory is still 174.1MB. Free memory was 146.2MB in the beginning and 143.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.55ms. Allocated memory is still 174.1MB. Free memory was 143.3MB in the beginning and 141.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 379.53ms. Allocated memory is still 174.1MB. Free memory was 141.2MB in the beginning and 125.8MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3008.30ms. Allocated memory was 174.1MB in the beginning and 209.7MB in the end (delta: 35.7MB). Free memory was 125.8MB in the beginning and 94.8MB in the end (delta: 31.0MB). Peak memory consumption was 70.3MB. Max. memory is 16.1GB. * Witness Printer took 4.33ms. Allocated memory is still 209.7MB. Free memory was 94.8MB in the beginning and 93.8MB in the end (delta: 1.0MB). 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 shiftRight at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 2; [L23] unsigned short int var_1_2 = 45931; [L24] unsigned short int var_1_3 = 30067; [L25] unsigned short int var_1_4 = 256; [L26] unsigned short int var_1_5 = 10000; [L27] unsigned short int var_1_6 = 5; [L28] signed long int var_1_7 = -5; VAL [isInitial=0, var_1_1=2, var_1_2=45931, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L62] isInitial = 1 [L63] FCALL initially() [L64] COND TRUE 1 [L65] FCALL updateLastVariables() [L66] CALL updateVariables() [L39] var_1_2 = __VERIFIER_nondet_ushort() [L40] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L40] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] CALL assume_abort_if_not(var_1_2 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L41] RET assume_abort_if_not(var_1_2 <= 65534) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=30067, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L42] var_1_3 = __VERIFIER_nondet_ushort() [L43] CALL assume_abort_if_not(var_1_3 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L43] RET assume_abort_if_not(var_1_3 >= 24575) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L44] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=256, var_1_5=10000, var_1_6=5, var_1_7=-5] [L45] var_1_4 = __VERIFIER_nondet_ushort() [L46] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_5=10000, var_1_6=5, var_1_7=-5] [L46] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] CALL assume_abort_if_not(var_1_4 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L47] RET assume_abort_if_not(var_1_4 <= 8192) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=10000, var_1_6=5, var_1_7=-5] [L48] var_1_5 = __VERIFIER_nondet_ushort() [L49] CALL assume_abort_if_not(var_1_5 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L49] RET assume_abort_if_not(var_1_5 >= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L50] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=5, var_1_7=-5] [L51] var_1_6 = __VERIFIER_nondet_ushort() [L52] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_7=-5] [L52] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_7=-5] [L53] CALL assume_abort_if_not(var_1_6 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L53] RET assume_abort_if_not(var_1_6 <= 8191) VAL [isInitial=1, var_1_1=2, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L66] RET updateVariables() [L67] CALL step() [L32] var_1_1 = (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L33] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L33] signed long int stepLocal_0 = (var_1_3 + var_1_6) >> var_1_1; [L34] COND FALSE !(var_1_4 != stepLocal_0) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L67] RET step() [L68] CALL, EXPR property() [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L58] EXPR (var_1_3 + var_1_6) >> var_1_1 VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L58] EXPR (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L58-L59] return (var_1_1 == ((unsigned short int) (var_1_2 - ((var_1_3 - var_1_4) - (var_1_5 - var_1_6))))) && ((var_1_4 != ((var_1_3 + var_1_6) >> var_1_1)) ? (var_1_7 == ((signed long int) var_1_2)) : 1) ; [L68] RET, EXPR property() [L68] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] [L19] reach_error() VAL [isInitial=1, var_1_1=40958, var_1_2=-2147352578, var_1_3=32767, var_1_4=0, var_1_5=8191, var_1_6=0, var_1_7=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 7, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 86 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 955 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 637 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 259 IncrementalHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 318 mSDtfsCounter, 259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 166 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=4, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 41 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 802 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1080/1080 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 00:36:00,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:36:02,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:36:02,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:36:02,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:36:02,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:36:02,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:36:02,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:36:02,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:36:02,293 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:36:02,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:36:02,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:36:02,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:36:02,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:36:02,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:36:02,297 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:36:02,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:36:02,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:36:02,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:36:02,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:36:02,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:36:02,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:36:02,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:36:02,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:36:02,303 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:36:02,303 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:36:02,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:36:02,304 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:36:02,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:36:02,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:36:02,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:36:02,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:36:02,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:36:02,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:36:02,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:36:02,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:36:02,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:36:02,315 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:36:02,316 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:36:02,317 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:36:02,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:36:02,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:36:02,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:36:02,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:36:02,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:36:02,318 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> daecda5a34625d8e7f3f0a930a730363a7677d8fd3b8cd0943f5f6f1bfbdafff [2024-11-09 00:36:02,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:36:02,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:36:02,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:36:02,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:36:02,667 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:36:02,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-09 00:36:04,150 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:36:04,375 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:36:04,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i [2024-11-09 00:36:04,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db0876e4/ad156eb6be184fbb844bd2584048c173/FLAG4b2d1eb5b [2024-11-09 00:36:04,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1db0876e4/ad156eb6be184fbb844bd2584048c173 [2024-11-09 00:36:04,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:36:04,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:36:04,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:36:04,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:36:04,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:36:04,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e359e5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04, skipping insertion in model container [2024-11-09 00:36:04,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:36:04,637 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-09 00:36:04,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:36:04,687 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:36:04,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount10_file-94.i[915,928] [2024-11-09 00:36:04,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:36:04,735 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:36:04,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04 WrapperNode [2024-11-09 00:36:04,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:36:04,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:36:04,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:36:04,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:36:04,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,790 INFO L138 Inliner]: procedures = 27, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2024-11-09 00:36:04,792 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:36:04,793 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:36:04,794 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:36:04,794 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:36:04,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,826 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:36:04,827 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,827 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,835 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,847 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:36:04,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:36:04,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:36:04,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:36:04,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (1/1) ... [2024-11-09 00:36:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:36:04,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:36:04,892 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:36:04,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:36:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:36:04,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:36:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:36:04,945 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:36:04,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:36:04,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:36:05,018 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:36:05,021 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:36:05,238 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-09 00:36:05,238 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:36:05,252 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:36:05,253 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:36:05,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:36:05 BoogieIcfgContainer [2024-11-09 00:36:05,253 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:36:05,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:36:05,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:36:05,260 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:36:05,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:36:04" (1/3) ... [2024-11-09 00:36:05,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d79745c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:36:05, skipping insertion in model container [2024-11-09 00:36:05,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:36:04" (2/3) ... [2024-11-09 00:36:05,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d79745c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:36:05, skipping insertion in model container [2024-11-09 00:36:05,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:36:05" (3/3) ... [2024-11-09 00:36:05,264 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-94.i [2024-11-09 00:36:05,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:36:05,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:36:05,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:36:05,357 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;@7a31cfc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:36:05,358 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:36:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:36:05,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 00:36:05,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:36:05,374 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:36:05,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:36:05,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:36:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash -927168940, now seen corresponding path program 1 times [2024-11-09 00:36:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:36:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104307399] [2024-11-09 00:36:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:36:05,395 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:36:05,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:36:05,398 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:36:05,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 00:36:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:06,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 00:36:06,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:36:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 147 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 00:36:07,913 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:36:08,349 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:36:08,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:36:08,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104307399] [2024-11-09 00:36:08,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104307399] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:36:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:36:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [27] total 31 [2024-11-09 00:36:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841576673] [2024-11-09 00:36:08,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:36:08,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:36:08,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:36:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:36:08,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-11-09 00:36:08,387 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:36:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:36:08,616 INFO L93 Difference]: Finished difference Result 69 states and 109 transitions. [2024-11-09 00:36:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:36:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-11-09 00:36:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:36:08,625 INFO L225 Difference]: With dead ends: 69 [2024-11-09 00:36:08,625 INFO L226 Difference]: Without dead ends: 37 [2024-11-09 00:36:08,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=862, Unknown=0, NotChecked=0, Total=1056 [2024-11-09 00:36:08,631 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:36:08,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 133 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:36:08,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-09 00:36:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2024-11-09 00:36:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 00:36:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-09 00:36:08,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 65 [2024-11-09 00:36:08,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:36:08,668 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-09 00:36:08,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:36:08,669 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-09 00:36:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-09 00:36:08,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:36:08,672 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:36:08,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:36:08,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:36:08,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:36:08,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:36:08,874 INFO L85 PathProgramCache]: Analyzing trace with hash -925321898, now seen corresponding path program 1 times [2024-11-09 00:36:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:36:08,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748856755] [2024-11-09 00:36:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:36:08,875 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:36:08,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:36:08,878 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 00:36:08,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 00:36:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:36:09,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 00:36:09,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:36:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 145 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 00:36:10,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:36:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-09 00:36:11,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:36:11,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748856755] [2024-11-09 00:36:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748856755] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 00:36:11,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 00:36:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [30] total 34 [2024-11-09 00:36:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881230659] [2024-11-09 00:36:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:36:11,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:36:11,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:36:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:36:11,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=895, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 00:36:11,365 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:36:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:36:11,604 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2024-11-09 00:36:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 00:36:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 65 [2024-11-09 00:36:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:36:11,606 INFO L225 Difference]: With dead ends: 37 [2024-11-09 00:36:11,606 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:36:11,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 00:36:11,608 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:36:11,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:36:11,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:36:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:36:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 00:36:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:36:11,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2024-11-09 00:36:11,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:36:11,610 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:36:11,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-09 00:36:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:36:11,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:36:11,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:36:11,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 00:36:11,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 00:36:11,818 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 00:36:11,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:36:11,839 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:36:11,855 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:36:11 BoogieIcfgContainer [2024-11-09 00:36:11,856 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:36:11,856 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:36:11,856 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:36:11,857 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:36:11,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:36:05" (3/4) ... [2024-11-09 00:36:11,859 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:36:11,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:36:11,868 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-09 00:36:11,868 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 00:36:11,869 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:36:11,869 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:36:11,967 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:36:11,968 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:36:11,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:36:11,969 INFO L158 Benchmark]: Toolchain (without parser) took 7557.52ms. Allocated memory was 60.8MB in the beginning and 94.4MB in the end (delta: 33.6MB). Free memory was 39.1MB in the beginning and 49.3MB in the end (delta: -10.2MB). Peak memory consumption was 23.2MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,969 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 60.8MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:36:11,970 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.69ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 25.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.05ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 25.2MB in the beginning and 58.0MB in the end (delta: -32.8MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,971 INFO L158 Benchmark]: Boogie Preprocessor took 61.64ms. Allocated memory is still 77.6MB. Free memory was 58.0MB in the beginning and 55.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,971 INFO L158 Benchmark]: RCFGBuilder took 398.01ms. Allocated memory is still 77.6MB. Free memory was 55.9MB in the beginning and 43.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,971 INFO L158 Benchmark]: TraceAbstraction took 6598.93ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 42.6MB in the beginning and 54.4MB in the end (delta: -11.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,971 INFO L158 Benchmark]: Witness Printer took 111.70ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 49.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:36:11,973 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 60.8MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.69ms. Allocated memory is still 60.8MB. Free memory was 38.9MB in the beginning and 25.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.05ms. Allocated memory was 60.8MB in the beginning and 77.6MB in the end (delta: 16.8MB). Free memory was 25.2MB in the beginning and 58.0MB in the end (delta: -32.8MB). Peak memory consumption was 3.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.64ms. Allocated memory is still 77.6MB. Free memory was 58.0MB in the beginning and 55.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 398.01ms. Allocated memory is still 77.6MB. Free memory was 55.9MB in the beginning and 43.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6598.93ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 42.6MB in the beginning and 54.4MB in the end (delta: -11.8MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 111.70ms. Allocated memory is still 94.4MB. Free memory was 54.4MB in the beginning and 49.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 2, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 285 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 207 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 95 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 78 mSDtfsCounter, 95 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 260 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 256 ConstructedInterpolants, 0 QuantifiedInterpolants, 2396 SizeOfPredicates, 15 NumberOfNonLiveVariables, 217 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 657/720 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: 64]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:36:12,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE