./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_codestructure_dependencies_file-34.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_codestructure_dependencies_file-34.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 ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:07:12,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:07:12,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:07:12,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:07:12,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:07:12,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:07:12,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:07:12,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:07:12,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:07:12,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:07:12,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:07:12,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:07:12,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:07:12,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:07:12,875 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:07:12,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:07:12,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:07:12,876 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:07:12,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:07:12,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:07:12,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:07:12,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:07:12,880 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:07:12,880 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:07:12,880 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:07:12,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:07:12,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:07:12,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:07:12,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:07:12,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:07:12,881 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:07:12,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:07:12,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:07:12,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:07:12,882 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:07:12,882 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:07:12,882 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:07:12,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:07:12,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:07:12,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:07:12,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:07:12,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:07:12,885 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 -> ef5fa028017d876074069fbbea93055df8f895424627b4673992e11de8e7d01a [2024-10-24 05:07:13,104 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:07:13,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:07:13,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:07:13,132 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:07:13,133 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:07:13,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-10-24 05:07:14,504 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:07:14,662 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:07:14,663 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-34.i [2024-10-24 05:07:14,670 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca134458a/50d0b115ba354f5fa575fdd6749cbeea/FLAG52d0f74d1 [2024-10-24 05:07:14,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca134458a/50d0b115ba354f5fa575fdd6749cbeea [2024-10-24 05:07:14,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:07:14,685 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:07:14,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:07:14,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:07:14,695 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:07:14,696 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:14,696 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34e9e37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14, skipping insertion in model container [2024-10-24 05:07:14,697 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:14,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:07:14,862 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_codestructure_dependencies_file-34.i[919,932] [2024-10-24 05:07:14,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:07:14,913 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:07:14,925 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_codestructure_dependencies_file-34.i[919,932] [2024-10-24 05:07:14,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:07:14,961 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:07:14,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14 WrapperNode [2024-10-24 05:07:14,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:07:14,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:07:14,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:07:14,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:07:14,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:14,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,016 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-24 05:07:15,020 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:07:15,021 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:07:15,021 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:07:15,021 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:07:15,033 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,062 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 05:07:15,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,062 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,071 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,089 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:07:15,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:07:15,090 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:07:15,090 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:07:15,091 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (1/1) ... [2024-10-24 05:07:15,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:07:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:07:15,138 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 05:07:15,145 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 05:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:07:15,186 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:07:15,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:07:15,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:07:15,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:07:15,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:07:15,255 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:07:15,259 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:07:15,664 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 05:07:15,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:07:15,693 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:07:15,694 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:07:15,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:07:15 BoogieIcfgContainer [2024-10-24 05:07:15,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:07:15,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:07:15,696 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:07:15,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:07:15,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:07:14" (1/3) ... [2024-10-24 05:07:15,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4da07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:07:15, skipping insertion in model container [2024-10-24 05:07:15,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:07:14" (2/3) ... [2024-10-24 05:07:15,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4da07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:07:15, skipping insertion in model container [2024-10-24 05:07:15,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:07:15" (3/3) ... [2024-10-24 05:07:15,701 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-34.i [2024-10-24 05:07:15,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:07:15,715 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:07:15,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:07:15,771 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;@f66644b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:07:15,771 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:07:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 05:07:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 05:07:15,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:07:15,784 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:07:15,785 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:07:15,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:07:15,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1474610218, now seen corresponding path program 1 times [2024-10-24 05:07:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:07:15,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125853812] [2024-10-24 05:07:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:07:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:07:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:07:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:07:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:07:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:07:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:07:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:07:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:07:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:07:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:07:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:07:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:07:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:07:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:07:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,120 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:07:16,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:07:16,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125853812] [2024-10-24 05:07:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125853812] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:07:16,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:07:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:07:16,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737543763] [2024-10-24 05:07:16,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:07:16,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:07:16,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:07:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:07:16,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:07:16,152 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.574468085106383) internal successors, (74), 48 states have internal predecessors, (74), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:07:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:07:16,187 INFO L93 Difference]: Finished difference Result 123 states and 211 transitions. [2024-10-24 05:07:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:07:16,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 88 [2024-10-24 05:07:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:07:16,196 INFO L225 Difference]: With dead ends: 123 [2024-10-24 05:07:16,196 INFO L226 Difference]: Without dead ends: 61 [2024-10-24 05:07:16,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:07:16,204 INFO L432 NwaCegarLoop]: 92 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, 92 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 05:07:16,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:07:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-24 05:07:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-10-24 05:07:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.5) internal successors, (69), 46 states have internal predecessors, (69), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 05:07:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 95 transitions. [2024-10-24 05:07:16,247 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 95 transitions. Word has length 88 [2024-10-24 05:07:16,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:07:16,247 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 95 transitions. [2024-10-24 05:07:16,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:07:16,247 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 95 transitions. [2024-10-24 05:07:16,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 05:07:16,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:07:16,251 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:07:16,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:07:16,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:07:16,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:07:16,252 INFO L85 PathProgramCache]: Analyzing trace with hash 817111188, now seen corresponding path program 1 times [2024-10-24 05:07:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:07:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129546832] [2024-10-24 05:07:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:07:16,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:07:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:07:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:07:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:07:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:07:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:07:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:07:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:07:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:07:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:07:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:07:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:07:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:07:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:07:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:07:16,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:07:16,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129546832] [2024-10-24 05:07:16,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129546832] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:07:16,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:07:16,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:07:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872456208] [2024-10-24 05:07:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:07:16,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:07:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:07:16,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:07:16,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:07:16,684 INFO L87 Difference]: Start difference. First operand 61 states and 95 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:16,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:07:16,815 INFO L93 Difference]: Finished difference Result 208 states and 325 transitions. [2024-10-24 05:07:16,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:07:16,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-10-24 05:07:16,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:07:16,818 INFO L225 Difference]: With dead ends: 208 [2024-10-24 05:07:16,818 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 05:07:16,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:07:16,823 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 120 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:07:16,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 301 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:07:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 05:07:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2024-10-24 05:07:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 92 states have internal predecessors, (137), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:07:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 189 transitions. [2024-10-24 05:07:16,849 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 189 transitions. Word has length 88 [2024-10-24 05:07:16,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:07:16,849 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 189 transitions. [2024-10-24 05:07:16,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:16,850 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 189 transitions. [2024-10-24 05:07:16,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-24 05:07:16,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:07:16,852 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:07:16,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:07:16,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:07:16,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:07:16,857 INFO L85 PathProgramCache]: Analyzing trace with hash -50424184, now seen corresponding path program 1 times [2024-10-24 05:07:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:07:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664759539] [2024-10-24 05:07:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:07:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:07:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:07:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:07:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:07:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:07:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:07:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:07:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:07:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:07:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:07:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:07:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:07:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:07:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:07:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:07:17,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:07:17,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664759539] [2024-10-24 05:07:17,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664759539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:07:17,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:07:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:07:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217111876] [2024-10-24 05:07:17,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:07:17,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:07:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:07:17,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:07:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:07:17,097 INFO L87 Difference]: Start difference. First operand 121 states and 189 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:17,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:07:17,335 INFO L93 Difference]: Finished difference Result 390 states and 603 transitions. [2024-10-24 05:07:17,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:07:17,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2024-10-24 05:07:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:07:17,338 INFO L225 Difference]: With dead ends: 390 [2024-10-24 05:07:17,340 INFO L226 Difference]: Without dead ends: 270 [2024-10-24 05:07:17,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:07:17,343 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 153 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:07:17,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 234 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:07:17,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-24 05:07:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 123. [2024-10-24 05:07:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:07:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 189 transitions. [2024-10-24 05:07:17,395 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 189 transitions. Word has length 89 [2024-10-24 05:07:17,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:07:17,397 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 189 transitions. [2024-10-24 05:07:17,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:17,397 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 189 transitions. [2024-10-24 05:07:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 05:07:17,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:07:17,401 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:07:17,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:07:17,401 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:07:17,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:07:17,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2126214973, now seen corresponding path program 1 times [2024-10-24 05:07:17,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:07:17,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907927495] [2024-10-24 05:07:17,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:07:17,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:07:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:07:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:07:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:07:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:07:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:07:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:07:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:07:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:07:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:07:20,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:07:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:07:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:07:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:07:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:07:20,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:07:20,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907927495] [2024-10-24 05:07:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907927495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:07:20,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:07:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 05:07:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528303664] [2024-10-24 05:07:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:07:20,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 05:07:20,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:07:20,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 05:07:20,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:07:20,205 INFO L87 Difference]: Start difference. First operand 123 states and 189 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:07:21,958 INFO L93 Difference]: Finished difference Result 368 states and 552 transitions. [2024-10-24 05:07:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 05:07:21,959 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-24 05:07:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:07:21,961 INFO L225 Difference]: With dead ends: 368 [2024-10-24 05:07:21,961 INFO L226 Difference]: Without dead ends: 246 [2024-10-24 05:07:21,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:07:21,962 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 282 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 05:07:21,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 322 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 05:07:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-24 05:07:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 158. [2024-10-24 05:07:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 122 states have (on average 1.4344262295081966) internal successors, (175), 123 states have internal predecessors, (175), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 05:07:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2024-10-24 05:07:21,985 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 90 [2024-10-24 05:07:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:07:21,985 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2024-10-24 05:07:21,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2024-10-24 05:07:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-24 05:07:21,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:07:21,987 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:07:21,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:07:21,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:07:21,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:07:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1467687745, now seen corresponding path program 1 times [2024-10-24 05:07:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:07:21,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334443144] [2024-10-24 05:07:21,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:07:21,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:07:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:07:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:07:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:07:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:07:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:07:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:07:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:07:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:07:22,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:07:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:07:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:07:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:07:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:07:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:07:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:07:22,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:07:22,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334443144] [2024-10-24 05:07:22,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334443144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:07:22,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:07:22,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:07:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732328709] [2024-10-24 05:07:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:07:22,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:07:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:07:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:07:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:07:22,277 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:07:22,448 INFO L93 Difference]: Finished difference Result 389 states and 580 transitions. [2024-10-24 05:07:22,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:07:22,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 90 [2024-10-24 05:07:22,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:07:22,450 INFO L225 Difference]: With dead ends: 389 [2024-10-24 05:07:22,450 INFO L226 Difference]: Without dead ends: 239 [2024-10-24 05:07:22,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:07:22,451 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 74 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:07:22,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 209 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:07:22,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-24 05:07:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 191. [2024-10-24 05:07:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 146 states have (on average 1.417808219178082) internal successors, (207), 146 states have internal predecessors, (207), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:07:22,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2024-10-24 05:07:22,469 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 90 [2024-10-24 05:07:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:07:22,470 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2024-10-24 05:07:22,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:07:22,470 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2024-10-24 05:07:22,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 05:07:22,471 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:07:22,471 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:07:22,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:07:22,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:07:22,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:07:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1447828150, now seen corresponding path program 1 times [2024-10-24 05:07:22,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:07:22,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117806954] [2024-10-24 05:07:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:07:22,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:07:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:08:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:08:05,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:08:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:08:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:08:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:08:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:08:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:08:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:08:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:08:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:08:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:08:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:08:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:08:05,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:08:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117806954] [2024-10-24 05:08:05,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117806954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:08:05,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:08:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 05:08:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178893120] [2024-10-24 05:08:05,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:08:05,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:08:05,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:08:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:08:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:08:05,956 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:08:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:08:06,942 INFO L93 Difference]: Finished difference Result 320 states and 464 transitions. [2024-10-24 05:08:06,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 05:08:06,942 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-10-24 05:08:06,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:08:06,944 INFO L225 Difference]: With dead ends: 320 [2024-10-24 05:08:06,944 INFO L226 Difference]: Without dead ends: 318 [2024-10-24 05:08:06,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-24 05:08:06,945 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 412 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:08:06,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 512 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:08:06,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-10-24 05:08:06,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 209. [2024-10-24 05:08:06,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 164 states have (on average 1.420731707317073) internal successors, (233), 164 states have internal predecessors, (233), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:08:06,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 311 transitions. [2024-10-24 05:08:06,962 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 311 transitions. Word has length 93 [2024-10-24 05:08:06,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:08:06,962 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 311 transitions. [2024-10-24 05:08:06,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:08:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 311 transitions. [2024-10-24 05:08:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 05:08:06,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:08:06,963 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:08:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:08:06,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:08:06,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:08:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1648139816, now seen corresponding path program 1 times [2024-10-24 05:08:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:08:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376435548] [2024-10-24 05:08:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:08:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:08:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:08:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:08:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:08:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:08:07,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:08:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:08:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:08:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:08:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:08:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:08:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:07,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:08:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:08:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:08,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:08:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:08:08,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:08:08,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376435548] [2024-10-24 05:08:08,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376435548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:08:08,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:08:08,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:08:08,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335969754] [2024-10-24 05:08:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:08:08,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:08:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:08:08,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:08:08,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:08:08,028 INFO L87 Difference]: Start difference. First operand 209 states and 311 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:08:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:08:08,303 INFO L93 Difference]: Finished difference Result 407 states and 604 transitions. [2024-10-24 05:08:08,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:08:08,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 93 [2024-10-24 05:08:08,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:08:08,308 INFO L225 Difference]: With dead ends: 407 [2024-10-24 05:08:08,310 INFO L226 Difference]: Without dead ends: 257 [2024-10-24 05:08:08,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:08:08,311 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 111 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:08:08,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 240 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:08:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-10-24 05:08:08,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 215. [2024-10-24 05:08:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 170 states have (on average 1.4176470588235295) internal successors, (241), 170 states have internal predecessors, (241), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:08:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 319 transitions. [2024-10-24 05:08:08,357 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 319 transitions. Word has length 93 [2024-10-24 05:08:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:08:08,357 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 319 transitions. [2024-10-24 05:08:08,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 05:08:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 319 transitions. [2024-10-24 05:08:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 05:08:08,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:08:08,363 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:08:08,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:08:08,364 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:08:08,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:08:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash -140519752, now seen corresponding path program 1 times [2024-10-24 05:08:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:08:08,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379770199] [2024-10-24 05:08:08,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:08:08,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:08:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:08:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:08:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:08:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:08:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:08:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:08:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:08:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:08:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:08:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:08:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:08:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:08:45,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:08:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:08:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:08:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379770199] [2024-10-24 05:08:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379770199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:08:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:08:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 05:08:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250273558] [2024-10-24 05:08:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:08:45,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 05:08:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:08:45,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 05:08:45,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-24 05:08:45,553 INFO L87 Difference]: Start difference. First operand 215 states and 319 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:08:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:08:46,366 INFO L93 Difference]: Finished difference Result 338 states and 487 transitions. [2024-10-24 05:08:46,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 05:08:46,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-10-24 05:08:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:08:46,368 INFO L225 Difference]: With dead ends: 338 [2024-10-24 05:08:46,368 INFO L226 Difference]: Without dead ends: 336 [2024-10-24 05:08:46,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=114, Invalid=306, Unknown=0, NotChecked=0, Total=420 [2024-10-24 05:08:46,369 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 285 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:08:46,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 546 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:08:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2024-10-24 05:08:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 232. [2024-10-24 05:08:46,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 187 states have (on average 1.411764705882353) internal successors, (264), 187 states have internal predecessors, (264), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:08:46,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 342 transitions. [2024-10-24 05:08:46,388 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 342 transitions. Word has length 93 [2024-10-24 05:08:46,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:08:46,389 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 342 transitions. [2024-10-24 05:08:46,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:08:46,389 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 342 transitions. [2024-10-24 05:08:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 05:08:46,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:08:46,390 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:08:46,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 05:08:46,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:08:46,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:08:46,391 INFO L85 PathProgramCache]: Analyzing trace with hash -546316556, now seen corresponding path program 1 times [2024-10-24 05:08:46,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:08:46,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583399803] [2024-10-24 05:08:46,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:08:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:08:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:08:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:08:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 05:08:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:08:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 05:08:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:08:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 05:08:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:08:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 05:08:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:08:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 05:08:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:08:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:08:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:08:46,537 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 05:08:46,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:08:46,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583399803] [2024-10-24 05:08:46,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583399803] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:08:46,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:08:46,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:08:46,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30546941] [2024-10-24 05:08:46,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:08:46,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:08:46,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:08:46,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:08:46,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:08:46,540 INFO L87 Difference]: Start difference. First operand 232 states and 342 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:08:46,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:08:46,662 INFO L93 Difference]: Finished difference Result 438 states and 644 transitions. [2024-10-24 05:08:46,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:08:46,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 93 [2024-10-24 05:08:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:08:46,665 INFO L225 Difference]: With dead ends: 438 [2024-10-24 05:08:46,665 INFO L226 Difference]: Without dead ends: 275 [2024-10-24 05:08:46,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:08:46,666 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 88 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:08:46,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 413 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 05:08:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-24 05:08:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 233. [2024-10-24 05:08:46,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 188 states have (on average 1.4095744680851063) internal successors, (265), 188 states have internal predecessors, (265), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 05:08:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 343 transitions. [2024-10-24 05:08:46,687 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 343 transitions. Word has length 93 [2024-10-24 05:08:46,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:08:46,687 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 343 transitions. [2024-10-24 05:08:46,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 05:08:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 343 transitions. [2024-10-24 05:08:46,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 05:08:46,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:08:46,690 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:08:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 05:08:46,691 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:08:46,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:08:46,691 INFO L85 PathProgramCache]: Analyzing trace with hash 757784480, now seen corresponding path program 1 times [2024-10-24 05:08:46,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:08:46,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264006262] [2024-10-24 05:08:46,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:08:46,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:08:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat