./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-3.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-3.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 a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:53:52,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:53:52,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:53:52,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:53:52,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:53:52,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:53:52,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:53:52,826 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:53:52,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:53:52,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:53:52,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:53:52,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:53:52,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:53:52,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:53:52,828 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:53:52,831 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:53:52,831 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:53:52,831 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:53:52,832 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:53:52,832 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:53:52,832 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:53:52,836 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:53:52,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:53:52,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:53:52,837 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:53:52,837 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:53:52,837 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:53:52,838 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:53:52,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:53:52,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:53:52,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:53:52,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:53:52,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:53:52,839 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:53:52,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:53:52,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:53:52,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:53:52,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:53:52,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:53:52,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:53:52,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:53:52,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:53:52,845 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 -> a4661a79f995ce83b554327eb89182f2e104b0cd28a9d1560990b967de8c220f [2024-10-24 08:53:53,068 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:53:53,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:53:53,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:53:53,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:53:53,100 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:53:53,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2024-10-24 08:53:54,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:53:54,832 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:53:54,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-3.i [2024-10-24 08:53:54,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dbde683/000b6e3ef3604047a209af49f8268dff/FLAG50fb59dc5 [2024-10-24 08:53:54,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01dbde683/000b6e3ef3604047a209af49f8268dff [2024-10-24 08:53:54,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:53:54,861 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:53:54,862 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:53:54,863 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:53:54,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:53:54,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:53:54" (1/1) ... [2024-10-24 08:53:54,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d971ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:54, skipping insertion in model container [2024-10-24 08:53:54,871 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:53:54" (1/1) ... [2024-10-24 08:53:54,900 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:53:55,146 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-3.i[915,928] [2024-10-24 08:53:55,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:53:55,210 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:53:55,222 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-3.i[915,928] [2024-10-24 08:53:55,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:53:55,264 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:53:55,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55 WrapperNode [2024-10-24 08:53:55,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:53:55,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:53:55,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:53:55,267 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:53:55,274 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:53:55" (1/1) ... [2024-10-24 08:53:55,282 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:53:55" (1/1) ... [2024-10-24 08:53:55,308 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-10-24 08:53:55,308 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:53:55,309 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:53:55,309 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:53:55,309 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:53:55,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,325 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,343 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:53:55,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:53:55,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:53:55,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:53:55,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:53:55,361 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (1/1) ... [2024-10-24 08:53:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:53:55,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:53:55,414 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:53:55,418 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:53:55,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:53:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:53:55,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:53:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:53:55,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:53:55,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:53:55,553 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:53:55,555 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:53:55,795 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 08:53:55,795 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:53:55,856 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:53:55,856 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:53:55,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:53:55 BoogieIcfgContainer [2024-10-24 08:53:55,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:53:55,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:53:55,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:53:55,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:53:55,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:53:54" (1/3) ... [2024-10-24 08:53:55,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1793739b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:53:55, skipping insertion in model container [2024-10-24 08:53:55,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:53:55" (2/3) ... [2024-10-24 08:53:55,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1793739b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:53:55, skipping insertion in model container [2024-10-24 08:53:55,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:53:55" (3/3) ... [2024-10-24 08:53:55,870 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-3.i [2024-10-24 08:53:55,886 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:53:55,886 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:53:55,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:53:55,954 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;@550b01a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:53:55,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:53:55,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:53:55,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 08:53:55,969 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:53:55,970 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:55,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:53:55,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:53:55,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1621476614, now seen corresponding path program 1 times [2024-10-24 08:53:55,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:53:55,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129771640] [2024-10-24 08:53:55,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:53:55,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:53:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:53:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:53:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:53:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:53:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:53:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:53:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:53:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:53:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:53:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:53:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:53:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:53:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:53:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:53:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:53:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:53:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:53:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:53:56,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:53:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:53:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:53:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:53:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129771640] [2024-10-24 08:53:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129771640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:53:56,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:53:56,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:53:56,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783915052] [2024-10-24 08:53:56,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:53:56,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:53:56,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:53:56,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:53:56,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:53:56,472 INFO L87 Difference]: Start difference. First operand has 50 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 28 states have internal predecessors, (38), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:53:56,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:53:56,542 INFO L93 Difference]: Finished difference Result 97 states and 174 transitions. [2024-10-24 08:53:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:53:56,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2024-10-24 08:53:56,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:53:56,556 INFO L225 Difference]: With dead ends: 97 [2024-10-24 08:53:56,557 INFO L226 Difference]: Without dead ends: 48 [2024-10-24 08:53:56,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:53:56,566 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:53:56,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:53:56,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-24 08:53:56,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-24 08:53:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 08:53:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-24 08:53:56,624 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 120 [2024-10-24 08:53:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:53:56,625 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-24 08:53:56,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 08:53:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-24 08:53:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 08:53:56,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:53:56,629 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:56,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:53:56,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:53:56,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:53:56,630 INFO L85 PathProgramCache]: Analyzing trace with hash -732484346, now seen corresponding path program 1 times [2024-10-24 08:53:56,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:53:56,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659138027] [2024-10-24 08:53:56,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:53:56,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:53:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:53:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:53:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:53:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:53:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:53:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:53:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:53:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:53:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:53:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:53:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:53:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:53:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:53:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:53:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:53:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:53:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:53:57,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:53:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:53:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:53:57,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:53:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:53:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659138027] [2024-10-24 08:53:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659138027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:53:57,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:53:57,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:53:57,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950474000] [2024-10-24 08:53:57,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:53:57,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:53:57,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:53:57,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:53:57,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:53:57,104 INFO L87 Difference]: Start difference. First operand 48 states and 73 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:53:57,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:53:57,160 INFO L93 Difference]: Finished difference Result 142 states and 217 transitions. [2024-10-24 08:53:57,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:53:57,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-24 08:53:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:53:57,166 INFO L225 Difference]: With dead ends: 142 [2024-10-24 08:53:57,166 INFO L226 Difference]: Without dead ends: 95 [2024-10-24 08:53:57,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:53:57,170 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 35 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:53:57,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 135 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:53:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-24 08:53:57,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2024-10-24 08:53:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:53:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 141 transitions. [2024-10-24 08:53:57,208 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 141 transitions. Word has length 120 [2024-10-24 08:53:57,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:53:57,209 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 141 transitions. [2024-10-24 08:53:57,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:53:57,209 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 141 transitions. [2024-10-24 08:53:57,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 08:53:57,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:53:57,211 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:57,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:53:57,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:53:57,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:53:57,212 INFO L85 PathProgramCache]: Analyzing trace with hash -730637304, now seen corresponding path program 1 times [2024-10-24 08:53:57,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:53:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324469092] [2024-10-24 08:53:57,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:53:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:53:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:53:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:53:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:53:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:53:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:53:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:53:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:53:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:53:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:53:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:53:57,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:53:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:53:57,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:53:57,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:53:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:53:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:53:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:53:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:53:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:53:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:53:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:53:57,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:53:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324469092] [2024-10-24 08:53:57,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324469092] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:53:57,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034680690] [2024-10-24 08:53:57,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:53:57,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:53:57,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:53:57,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:53:57,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:53:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:53:57,799 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 08:53:57,808 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:53:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 93 proven. 54 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2024-10-24 08:53:58,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 08:53:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-24 08:53:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034680690] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 08:53:58,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 08:53:58,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-24 08:53:58,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054470427] [2024-10-24 08:53:58,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 08:53:58,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:53:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:53:58,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:53:58,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:53:58,456 INFO L87 Difference]: Start difference. First operand 92 states and 141 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 08:53:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:53:58,679 INFO L93 Difference]: Finished difference Result 199 states and 295 transitions. [2024-10-24 08:53:58,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:53:58,680 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 120 [2024-10-24 08:53:58,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:53:58,683 INFO L225 Difference]: With dead ends: 199 [2024-10-24 08:53:58,683 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 08:53:58,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-24 08:53:58,687 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:53:58,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 98 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:53:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 08:53:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2024-10-24 08:53:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:53:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-10-24 08:53:58,707 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 120 [2024-10-24 08:53:58,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:53:58,707 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-10-24 08:53:58,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-10-24 08:53:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-10-24 08:53:58,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 08:53:58,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:53:58,710 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:58,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 08:53:58,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:53:58,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:53:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:53:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash -730577722, now seen corresponding path program 1 times [2024-10-24 08:53:58,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:53:58,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880929085] [2024-10-24 08:53:58,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:53:58,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:53:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:01,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:01,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:01,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:01,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:01,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:54:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:54:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:01,893 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:01,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:01,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880929085] [2024-10-24 08:54:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880929085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:01,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:01,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:54:01,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858079500] [2024-10-24 08:54:01,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:01,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:54:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:01,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:54:01,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:54:01,896 INFO L87 Difference]: Start difference. First operand 100 states and 145 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:02,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:02,139 INFO L93 Difference]: Finished difference Result 123 states and 171 transitions. [2024-10-24 08:54:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:54:02,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2024-10-24 08:54:02,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:02,142 INFO L225 Difference]: With dead ends: 123 [2024-10-24 08:54:02,142 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 08:54:02,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:02,144 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 26 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:02,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 236 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 08:54:02,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2024-10-24 08:54:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:54:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2024-10-24 08:54:02,163 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 120 [2024-10-24 08:54:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:02,163 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2024-10-24 08:54:02,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:02,164 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2024-10-24 08:54:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 08:54:02,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:02,166 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:54:02,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:02,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:02,167 INFO L85 PathProgramCache]: Analyzing trace with hash -7674365, now seen corresponding path program 1 times [2024-10-24 08:54:02,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:02,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868417202] [2024-10-24 08:54:02,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:02,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:03,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:03,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:03,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:54:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:54:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:03,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868417202] [2024-10-24 08:54:03,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868417202] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:03,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:54:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177990680] [2024-10-24 08:54:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:03,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:54:03,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:54:03,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:54:03,317 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:03,466 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2024-10-24 08:54:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:54:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-24 08:54:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:03,469 INFO L225 Difference]: With dead ends: 133 [2024-10-24 08:54:03,469 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 08:54:03,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:03,470 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 33 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:03,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 322 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 08:54:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 105. [2024-10-24 08:54:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 60 states have internal predecessors, (71), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:54:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 151 transitions. [2024-10-24 08:54:03,497 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 151 transitions. Word has length 121 [2024-10-24 08:54:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:03,498 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 151 transitions. [2024-10-24 08:54:03,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 151 transitions. [2024-10-24 08:54:03,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 08:54:03,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:03,500 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:54:03,500 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:03,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:03,501 INFO L85 PathProgramCache]: Analyzing trace with hash -5827323, now seen corresponding path program 1 times [2024-10-24 08:54:03,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:03,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389082009] [2024-10-24 08:54:03,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:03,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:03,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:05,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:54:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:54:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:05,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389082009] [2024-10-24 08:54:05,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389082009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:05,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:05,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:54:05,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543513379] [2024-10-24 08:54:05,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:05,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:54:05,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:05,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:54:05,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:54:05,158 INFO L87 Difference]: Start difference. First operand 105 states and 151 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:05,388 INFO L93 Difference]: Finished difference Result 131 states and 179 transitions. [2024-10-24 08:54:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:54:05,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-24 08:54:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:05,391 INFO L225 Difference]: With dead ends: 131 [2024-10-24 08:54:05,391 INFO L226 Difference]: Without dead ends: 129 [2024-10-24 08:54:05,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:05,392 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 28 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:05,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 406 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:05,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-10-24 08:54:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2024-10-24 08:54:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 59 states have internal predecessors, (69), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:54:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2024-10-24 08:54:05,415 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 121 [2024-10-24 08:54:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:05,416 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2024-10-24 08:54:05,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2024-10-24 08:54:05,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 08:54:05,418 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:05,418 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:54:05,419 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash 49583937, now seen corresponding path program 1 times [2024-10-24 08:54:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:05,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967501459] [2024-10-24 08:54:05,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:05,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:06,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:54:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:54:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967501459] [2024-10-24 08:54:06,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967501459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:06,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:06,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 08:54:06,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997956975] [2024-10-24 08:54:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:54:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:06,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:54:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:54:06,795 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:06,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:06,952 INFO L93 Difference]: Finished difference Result 137 states and 187 transitions. [2024-10-24 08:54:06,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:54:06,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-24 08:54:06,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:06,955 INFO L225 Difference]: With dead ends: 137 [2024-10-24 08:54:06,955 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 08:54:06,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-24 08:54:06,956 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 23 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:06,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 352 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:54:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 08:54:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 110. [2024-10-24 08:54:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 08:54:06,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 159 transitions. [2024-10-24 08:54:06,983 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 159 transitions. Word has length 121 [2024-10-24 08:54:06,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:06,983 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 159 transitions. [2024-10-24 08:54:06,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:06,984 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 159 transitions. [2024-10-24 08:54:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 08:54:06,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:54:06,987 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:54:06,987 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:54:06,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:54:06,988 INFO L85 PathProgramCache]: Analyzing trace with hash 51430979, now seen corresponding path program 1 times [2024-10-24 08:54:06,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:54:06,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422745337] [2024-10-24 08:54:06,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:54:06,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:54:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:54:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:54:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:54:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:54:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:54:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:54:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:54:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:54:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 08:54:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:54:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 08:54:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:54:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 08:54:08,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 08:54:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 08:54:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 08:54:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 08:54:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 08:54:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 08:54:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 08:54:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:54:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 08:54:08,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:54:08,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422745337] [2024-10-24 08:54:08,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422745337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:54:08,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:54:08,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 08:54:08,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482046013] [2024-10-24 08:54:08,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:54:08,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 08:54:08,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:54:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 08:54:08,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:54:08,499 INFO L87 Difference]: Start difference. First operand 110 states and 159 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:54:08,722 INFO L93 Difference]: Finished difference Result 133 states and 185 transitions. [2024-10-24 08:54:08,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 08:54:08,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2024-10-24 08:54:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:54:08,723 INFO L225 Difference]: With dead ends: 133 [2024-10-24 08:54:08,724 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 08:54:08,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:54:08,725 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 23 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:54:08,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 340 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:54:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 08:54:08,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 08:54:08,726 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:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 08:54:08,726 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2024-10-24 08:54:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:54:08,727 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 08:54:08,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 08:54:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 08:54:08,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 08:54:08,730 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:54:08,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:54:08,734 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:54:08,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 08:54:09,189 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:54:09,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:54:09 BoogieIcfgContainer [2024-10-24 08:54:09,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:54:09,207 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:54:09,207 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:54:09,208 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:54:09,208 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:53:55" (3/4) ... [2024-10-24 08:54:09,210 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 08:54:09,214 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 08:54:09,221 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-24 08:54:09,222 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 08:54:09,222 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 08:54:09,222 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 08:54:09,333 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 08:54:09,334 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 08:54:09,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:54:09,335 INFO L158 Benchmark]: Toolchain (without parser) took 14473.56ms. Allocated memory was 151.0MB in the beginning and 522.2MB in the end (delta: 371.2MB). Free memory was 95.6MB in the beginning and 273.4MB in the end (delta: -177.8MB). Peak memory consumption was 193.3MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,335 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:54:09,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.07ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 116.9MB in the end (delta: -21.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.02ms. Allocated memory is still 151.0MB. Free memory was 116.9MB in the beginning and 114.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,336 INFO L158 Benchmark]: Boogie Preprocessor took 49.81ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 112.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,336 INFO L158 Benchmark]: RCFGBuilder took 499.50ms. Allocated memory is still 151.0MB. Free memory was 112.1MB in the beginning and 93.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,336 INFO L158 Benchmark]: TraceAbstraction took 13345.66ms. Allocated memory was 151.0MB in the beginning and 522.2MB in the end (delta: 371.2MB). Free memory was 93.1MB in the beginning and 279.6MB in the end (delta: -186.5MB). Peak memory consumption was 187.7MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,337 INFO L158 Benchmark]: Witness Printer took 126.84ms. Allocated memory is still 522.2MB. Free memory was 278.6MB in the beginning and 273.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:54:09,338 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 49.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.07ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 116.9MB in the end (delta: -21.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.02ms. Allocated memory is still 151.0MB. Free memory was 116.9MB in the beginning and 114.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.81ms. Allocated memory is still 151.0MB. Free memory was 114.8MB in the beginning and 112.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.50ms. Allocated memory is still 151.0MB. Free memory was 112.1MB in the beginning and 93.8MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13345.66ms. Allocated memory was 151.0MB in the beginning and 522.2MB in the end (delta: 371.2MB). Free memory was 93.1MB in the beginning and 279.6MB in the end (delta: -186.5MB). Peak memory consumption was 187.7MB. Max. memory is 16.1GB. * Witness Printer took 126.84ms. Allocated memory is still 522.2MB. Free memory was 278.6MB in the beginning and 273.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 195 mSDsluCounter, 1959 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1396 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 724 IncrementalHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 563 mSDtfsCounter, 724 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 637 GetRequests, 594 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=7, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 104 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 1084 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1194 ConstructedInterpolants, 0 QuantifiedInterpolants, 3013 SizeOfPredicates, 1 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 7438/7600 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: 108]: Loop Invariant Derived loop invariant: (var_1_4 == 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((cond != 0) && ((((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (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))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 08:54:09,364 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