./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.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 ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:54:13,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:54:13,929 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:54:13,933 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:54:13,934 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:54:13,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:54:13,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:54:13,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:54:13,971 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:54:13,973 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:54:13,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:54:13,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:54:13,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:54:13,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:54:13,978 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:54:13,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:54:13,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:54:13,979 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:54:13,980 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:54:13,980 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:54:13,980 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:54:13,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:54:13,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:54:13,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:54:13,982 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:54:13,982 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:54:13,982 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:54:13,982 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:54:13,983 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:54:13,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:54:13,983 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:54:13,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:54:13,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:13,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:54:13,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:54:13,988 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:54:13,988 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:54:13,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:54:13,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:54:13,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:54:13,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:54:13,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:54:13,990 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 -> ec3847cd5673658302b62e6c9d30f5f024379aa30b6673222fdbc3270a2b4500 [2024-10-24 08:54:14,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:54:14,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:54:14,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:54:14,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:54:14,300 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:54:14,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2024-10-24 08:54:15,912 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:54:16,122 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:54:16,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i [2024-10-24 08:54:16,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03479f340/d313a9ca0f3f43cb945178bacebc0501/FLAGbfef4301a [2024-10-24 08:54:16,473 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03479f340/d313a9ca0f3f43cb945178bacebc0501 [2024-10-24 08:54:16,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:54:16,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:54:16,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:16,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:54:16,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:54:16,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a73e752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16, skipping insertion in model container [2024-10-24 08:54:16,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,515 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:54:16,693 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i[916,929] [2024-10-24 08:54:16,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:16,780 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:54:16,793 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-32.i[916,929] [2024-10-24 08:54:16,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:54:16,853 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:54:16,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16 WrapperNode [2024-10-24 08:54:16,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:54:16,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:16,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:54:16,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:54:16,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,928 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-24 08:54:16,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:54:16,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:54:16,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:54:16,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:54:16,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,947 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,972 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:54:16,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,973 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,982 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,990 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,996 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:16,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:17,005 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:54:17,006 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:54:17,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:54:17,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:54:17,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (1/1) ... [2024-10-24 08:54:17,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:54:17,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:54:17,043 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-10-24 08:54:17,047 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-10-24 08:54:17,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:54:17,098 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:54:17,099 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:54:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:54:17,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:54:17,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:54:17,176 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:54:17,179 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:54:17,519 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 08:54:17,519 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:54:17,581 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:54:17,582 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:54:17,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:17 BoogieIcfgContainer [2024-10-24 08:54:17,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:54:17,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:54:17,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:54:17,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:54:17,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:54:16" (1/3) ... [2024-10-24 08:54:17,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11609bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:54:17, skipping insertion in model container [2024-10-24 08:54:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:54:16" (2/3) ... [2024-10-24 08:54:17,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11609bd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:54:17, skipping insertion in model container [2024-10-24 08:54:17,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:17" (3/3) ... [2024-10-24 08:54:17,596 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-32.i [2024-10-24 08:54:17,610 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:54:17,610 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:54:17,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:54:17,681 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;@231a1edd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:54:17,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:54:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:54:17,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 08:54:17,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:17,696 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:17,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:17,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash 887830059, now seen corresponding path program 1 times [2024-10-24 08:54:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:17,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816493690] [2024-10-24 08:54:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:18,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:18,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:18,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816493690] [2024-10-24 08:54:18,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816493690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:18,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:18,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:54:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734739664] [2024-10-24 08:54:18,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:18,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:54:18,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:54:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:54:18,442 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:18,629 INFO L93 Difference]: Finished difference Result 95 states and 168 transitions. [2024-10-24 08:54:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:54:18,633 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 109 [2024-10-24 08:54:18,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:18,643 INFO L225 Difference]: With dead ends: 95 [2024-10-24 08:54:18,644 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 08:54:18,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:54:18,651 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:18,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 08:54:18,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 08:54:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 08:54:18,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2024-10-24 08:54:18,693 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 109 [2024-10-24 08:54:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:18,695 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2024-10-24 08:54:18,695 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:18,695 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2024-10-24 08:54:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 08:54:18,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:18,698 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:18,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:54:18,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1697176685, now seen corresponding path program 1 times [2024-10-24 08:54:18,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:18,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9310659] [2024-10-24 08:54:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:22,644 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:22,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:22,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9310659] [2024-10-24 08:54:22,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9310659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:22,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:22,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 08:54:22,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036362571] [2024-10-24 08:54:22,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:22,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:54:22,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:54:22,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:54:22,649 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-24 08:54:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:24,116 INFO L93 Difference]: Finished difference Result 151 states and 213 transitions. [2024-10-24 08:54:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 08:54:24,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 109 [2024-10-24 08:54:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:24,120 INFO L225 Difference]: With dead ends: 151 [2024-10-24 08:54:24,120 INFO L226 Difference]: Without dead ends: 149 [2024-10-24 08:54:24,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=126, Invalid=336, Unknown=0, NotChecked=0, Total=462 [2024-10-24 08:54:24,122 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 215 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:24,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 318 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:54:24,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-10-24 08:54:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 73. [2024-10-24 08:54:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:54:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-24 08:54:24,156 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 109 [2024-10-24 08:54:24,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:24,157 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-24 08:54:24,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-10-24 08:54:24,157 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-24 08:54:24,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 08:54:24,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:24,161 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:24,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:54:24,162 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:24,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:24,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1057797391, now seen corresponding path program 1 times [2024-10-24 08:54:24,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:24,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922597979] [2024-10-24 08:54:24,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:24,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:26,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:26,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922597979] [2024-10-24 08:54:26,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922597979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:26,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:26,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 08:54:26,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778113017] [2024-10-24 08:54:26,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:26,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:54:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:54:26,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:54:26,552 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:26,859 INFO L93 Difference]: Finished difference Result 92 states and 128 transitions. [2024-10-24 08:54:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:54:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 110 [2024-10-24 08:54:26,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:26,865 INFO L225 Difference]: With dead ends: 92 [2024-10-24 08:54:26,866 INFO L226 Difference]: Without dead ends: 90 [2024-10-24 08:54:26,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:54:26,868 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:26,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 259 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-24 08:54:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 74. [2024-10-24 08:54:26,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 48 states have internal predecessors, (60), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:54:26,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2024-10-24 08:54:26,897 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 108 transitions. Word has length 110 [2024-10-24 08:54:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:26,898 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 108 transitions. [2024-10-24 08:54:26,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 108 transitions. [2024-10-24 08:54:26,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 08:54:26,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:26,900 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:26,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:54:26,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1577699368, now seen corresponding path program 1 times [2024-10-24 08:54:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748668846] [2024-10-24 08:54:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:26,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:29,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748668846] [2024-10-24 08:54:29,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748668846] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:29,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 08:54:29,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097807882] [2024-10-24 08:54:29,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:29,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 08:54:29,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:29,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 08:54:29,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:54:29,852 INFO L87 Difference]: Start difference. First operand 74 states and 108 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:30,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:30,523 INFO L93 Difference]: Finished difference Result 86 states and 121 transitions. [2024-10-24 08:54:30,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 08:54:30,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-24 08:54:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:30,526 INFO L225 Difference]: With dead ends: 86 [2024-10-24 08:54:30,526 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 08:54:30,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:54:30,528 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:30,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 360 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:54:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 08:54:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 73. [2024-10-24 08:54:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 47 states have internal predecessors, (59), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:54:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 107 transitions. [2024-10-24 08:54:30,541 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 107 transitions. Word has length 111 [2024-10-24 08:54:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:30,542 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 107 transitions. [2024-10-24 08:54:30,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 107 transitions. [2024-10-24 08:54:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 08:54:30,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:30,544 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:30,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:54:30,544 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:30,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:30,544 INFO L85 PathProgramCache]: Analyzing trace with hash 958873527, now seen corresponding path program 1 times [2024-10-24 08:54:30,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:30,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927795908] [2024-10-24 08:54:30,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:30,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:31,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:31,748 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:31,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927795908] [2024-10-24 08:54:31,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927795908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:31,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:31,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:54:31,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067065417] [2024-10-24 08:54:31,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:31,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:54:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:31,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:54:31,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:31,755 INFO L87 Difference]: Start difference. First operand 73 states and 107 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:32,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:32,296 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2024-10-24 08:54:32,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 08:54:32,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 111 [2024-10-24 08:54:32,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:32,301 INFO L225 Difference]: With dead ends: 164 [2024-10-24 08:54:32,301 INFO L226 Difference]: Without dead ends: 92 [2024-10-24 08:54:32,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:54:32,304 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:32,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:32,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-10-24 08:54:32,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-10-24 08:54:32,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:54:32,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-24 08:54:32,324 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 111 [2024-10-24 08:54:32,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:32,325 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-24 08:54:32,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-24 08:54:32,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-24 08:54:32,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:32,330 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:32,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:54:32,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:32,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash -354764027, now seen corresponding path program 1 times [2024-10-24 08:54:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:32,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572409377] [2024-10-24 08:54:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:32,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:33,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:33,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:33,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:33,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:33,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:33,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:33,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:33,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:33,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572409377] [2024-10-24 08:54:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572409377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:33,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 08:54:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004331768] [2024-10-24 08:54:33,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:33,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:54:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:54:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:54:33,431 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:34,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:34,231 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2024-10-24 08:54:34,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:54:34,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 112 [2024-10-24 08:54:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:34,233 INFO L225 Difference]: With dead ends: 90 [2024-10-24 08:54:34,233 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 08:54:34,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:54:34,234 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:34,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 317 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 08:54:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 08:54:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2024-10-24 08:54:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-24 08:54:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 106 transitions. [2024-10-24 08:54:34,247 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 106 transitions. Word has length 112 [2024-10-24 08:54:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:34,248 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 106 transitions. [2024-10-24 08:54:34,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2024-10-24 08:54:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-24 08:54:34,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:34,250 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:34,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:54:34,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:34,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:34,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1877596512, now seen corresponding path program 1 times [2024-10-24 08:54:34,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:34,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362318814] [2024-10-24 08:54:34,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:34,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:36,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-24 08:54:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362318814] [2024-10-24 08:54:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362318814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:36,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 08:54:36,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718069826] [2024-10-24 08:54:36,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 08:54:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:36,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 08:54:36,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:54:36,716 INFO L87 Difference]: Start difference. First operand 73 states and 106 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:37,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:37,527 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2024-10-24 08:54:37,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:54:37,528 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-10-24 08:54:37,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:37,529 INFO L225 Difference]: With dead ends: 84 [2024-10-24 08:54:37,529 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 08:54:37,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-24 08:54:37,530 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 50 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:37,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 192 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:37,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 08:54:37,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 08:54:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 08:54:37,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 08:54:37,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-10-24 08:54:37,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:37,532 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 08:54:37,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-10-24 08:54:37,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 08:54:37,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 08:54:37,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:54:37,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:54:37,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:37,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 08:55:15,669 WARN L286 SmtUtils]: Spent 38.12s on a formula simplification. DAG size of input: 208 DAG size of output: 356 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-24 08:55:17,167 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:55:17,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:55:17 BoogieIcfgContainer [2024-10-24 08:55:17,191 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:55:17,192 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:55:17,192 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:55:17,192 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:55:17,195 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:54:17" (3/4) ... [2024-10-24 08:55:17,197 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 08:55:17,201 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 08:55:17,207 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 08:55:17,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-24 08:55:17,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 08:55:17,208 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 08:55:17,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 08:55:17,313 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 08:55:17,314 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:55:17,314 INFO L158 Benchmark]: Toolchain (without parser) took 60837.48ms. Allocated memory was 157.3MB in the beginning and 885.0MB in the end (delta: 727.7MB). Free memory was 102.1MB in the beginning and 678.2MB in the end (delta: -576.1MB). Peak memory consumption was 152.5MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,314 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 157.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:55:17,315 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.32ms. Allocated memory is still 157.3MB. Free memory was 102.1MB in the beginning and 86.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,315 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.02ms. Allocated memory is still 157.3MB. Free memory was 86.9MB in the beginning and 83.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,315 INFO L158 Benchmark]: Boogie Preprocessor took 73.14ms. Allocated memory is still 157.3MB. Free memory was 83.7MB in the beginning and 79.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,316 INFO L158 Benchmark]: RCFGBuilder took 576.54ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 79.0MB in the beginning and 168.9MB in the end (delta: -89.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,316 INFO L158 Benchmark]: TraceAbstraction took 59606.08ms. Allocated memory was 201.3MB in the beginning and 885.0MB in the end (delta: 683.7MB). Free memory was 167.9MB in the beginning and 684.5MB in the end (delta: -516.6MB). Peak memory consumption was 528.1MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,317 INFO L158 Benchmark]: Witness Printer took 122.10ms. Allocated memory is still 885.0MB. Free memory was 684.5MB in the beginning and 678.2MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:55:17,319 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 157.3MB. Free memory is still 117.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.32ms. Allocated memory is still 157.3MB. Free memory was 102.1MB in the beginning and 86.9MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.02ms. Allocated memory is still 157.3MB. Free memory was 86.9MB in the beginning and 83.7MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.14ms. Allocated memory is still 157.3MB. Free memory was 83.7MB in the beginning and 79.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 576.54ms. Allocated memory was 157.3MB in the beginning and 201.3MB in the end (delta: 44.0MB). Free memory was 79.0MB in the beginning and 168.9MB in the end (delta: -89.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 59606.08ms. Allocated memory was 201.3MB in the beginning and 885.0MB in the end (delta: 683.7MB). Free memory was 167.9MB in the beginning and 684.5MB in the end (delta: -516.6MB). Peak memory consumption was 528.1MB. Max. memory is 16.1GB. * Witness Printer took 122.10ms. Allocated memory is still 885.0MB. Free memory was 684.5MB in the beginning and 678.2MB in the end (delta: 6.3MB). 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, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.9s, OverallIterations: 7, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 1694 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1271 mSDsCounter, 100 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1222 IncrementalHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 100 mSolverCounterUnsat, 423 mSDtfsCounter, 1222 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=3, InterpolantAutomatonStates: 76, 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, 7 MinimizatonAttempts, 137 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 14.2s InterpolantComputationTime, 775 NumberOfCodeBlocks, 775 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 768 ConstructedInterpolants, 0 QuantifiedInterpolants, 5886 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 4284/4284 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: 104]: Loop Invariant Derived loop invariant: (((var_1_6 == 0) && (0 <= last_1_var_1_6)) || (((0 <= last_1_var_1_6) && (((((int) var_1_4 + var_1_3) <= var_1_5) && (var_1_1 == var_1_5)) || ((var_1_1 == ((int) var_1_4 + var_1_3)) && ((var_1_5 + 1) <= ((int) var_1_4 + var_1_3))))) && (0 <= var_1_6))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((0 <= last_1_var_1_6) && (0 <= var_1_6)) Ensures: (((0 <= last_1_var_1_6) && (0 <= var_1_6)) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (last_1_var_1_6 == \old(last_1_var_1_6)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 08:55:17,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE