./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_loopvsstraightlinecode_25-while_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:34:51,935 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:34:52,026 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:34:52,030 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:34:52,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:34:52,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:34:52,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:34:52,066 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:34:52,067 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:34:52,067 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:34:52,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:34:52,068 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:34:52,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:34:52,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:34:52,071 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:34:52,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:34:52,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:34:52,071 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:34:52,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:34:52,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:34:52,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:34:52,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:34:52,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:34:52,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:34:52,076 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:34:52,076 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:34:52,076 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:34:52,077 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:34:52,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:34:52,077 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:34:52,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:34:52,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:34:52,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:34:52,078 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:34:52,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:34:52,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:34:52,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:34:52,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:34:52,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:34:52,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:34:52,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:34:52,081 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:34:52,081 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0d45567a05c43a020d83c4148b7193297efc53c68aa1babb30080e6503f970de [2024-10-11 11:34:52,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:34:52,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:34:52,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:34:52,368 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:34:52,368 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:34:52,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i [2024-10-11 11:34:53,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:34:54,052 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:34:54,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-14.i [2024-10-11 11:34:54,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6281f15c/bffed16d924a495088e195f9df5c029d/FLAGb1f6a85b0 [2024-10-11 11:34:54,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a6281f15c/bffed16d924a495088e195f9df5c029d [2024-10-11 11:34:54,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:34:54,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:34:54,085 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:34:54,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:34:54,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:34:54,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e1f463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54, skipping insertion in model container [2024-10-11 11:34:54,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:34:54,277 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_loopvsstraightlinecode_25-while_file-14.i[915,928] [2024-10-11 11:34:54,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:34:54,320 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:34:54,329 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_loopvsstraightlinecode_25-while_file-14.i[915,928] [2024-10-11 11:34:54,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:34:54,365 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:34:54,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54 WrapperNode [2024-10-11 11:34:54,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:34:54,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:34:54,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:34:54,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:34:54,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,406 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-11 11:34:54,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:34:54,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:34:54,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:34:54,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:34:54,418 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,421 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,434 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:34:54,435 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,435 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,439 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,442 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,445 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:34:54,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:34:54,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:34:54,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:34:54,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (1/1) ... [2024-10-11 11:34:54,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:34:54,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:34:54,542 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:34:54,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:34:54,596 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:34:54,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:34:54,597 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:34:54,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:34:54,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:34:54,597 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:34:54,681 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:34:54,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:34:54,957 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 11:34:54,957 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:34:55,018 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:34:55,019 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:34:55,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:34:55 BoogieIcfgContainer [2024-10-11 11:34:55,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:34:55,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:34:55,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:34:55,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:34:55,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:34:54" (1/3) ... [2024-10-11 11:34:55,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154b92bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:34:55, skipping insertion in model container [2024-10-11 11:34:55,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:34:54" (2/3) ... [2024-10-11 11:34:55,028 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154b92bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:34:55, skipping insertion in model container [2024-10-11 11:34:55,028 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:34:55" (3/3) ... [2024-10-11 11:34:55,030 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-14.i [2024-10-11 11:34:55,048 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:34:55,048 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:34:55,115 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:34:55,123 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;@3ee1ba67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:34:55,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:34:55,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:34:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 11:34:55,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:55,137 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:34:55,137 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:55,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1052372421, now seen corresponding path program 1 times [2024-10-11 11:34:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:34:55,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509315029] [2024-10-11 11:34:55,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:34:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:34:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:34:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:34:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:34:55,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:34:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:34:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:34:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:34:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:34:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:34:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:34:55,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:34:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:34:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:34:55,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:34:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:34:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:34:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:34:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509315029] [2024-10-11 11:34:55,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509315029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:34:55,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:34:55,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:34:55,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605829862] [2024-10-11 11:34:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:55,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:34:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:34:55,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:34:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:34:55,523 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 27 states have internal predecessors, (36), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 11:34:55,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:34:55,572 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2024-10-11 11:34:55,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:34:55,576 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-11 11:34:55,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:34:55,584 INFO L225 Difference]: With dead ends: 87 [2024-10-11 11:34:55,585 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 11:34:55,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:34:55,596 INFO L432 NwaCegarLoop]: 60 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, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:34:55,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:34:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 11:34:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-11 11:34:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:34:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 63 transitions. [2024-10-11 11:34:55,640 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 63 transitions. Word has length 100 [2024-10-11 11:34:55,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:34:55,641 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 63 transitions. [2024-10-11 11:34:55,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 11:34:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 63 transitions. [2024-10-11 11:34:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 11:34:55,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:55,649 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:34:55,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:34:55,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:55,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash 67842619, now seen corresponding path program 1 times [2024-10-11 11:34:55,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:34:55,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365197691] [2024-10-11 11:34:55,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:55,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:34:55,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:34:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:34:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:34:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:34:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:34:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:34:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:34:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:34:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:34:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:34:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:34:56,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:34:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:34:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:34:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:34:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:34:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:34:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:34:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365197691] [2024-10-11 11:34:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365197691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:34:56,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:34:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:34:56,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767351197] [2024-10-11 11:34:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:56,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:34:56,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:34:56,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:34:56,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:34:56,273 INFO L87 Difference]: Start difference. First operand 43 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:34:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:34:56,407 INFO L93 Difference]: Finished difference Result 137 states and 199 transitions. [2024-10-11 11:34:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:34:56,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-11 11:34:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:34:56,410 INFO L225 Difference]: With dead ends: 137 [2024-10-11 11:34:56,410 INFO L226 Difference]: Without dead ends: 95 [2024-10-11 11:34:56,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-11 11:34:56,412 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:34:56,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 171 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:34:56,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-11 11:34:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2024-10-11 11:34:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:34:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 122 transitions. [2024-10-11 11:34:56,438 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 122 transitions. Word has length 100 [2024-10-11 11:34:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:34:56,439 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 122 transitions. [2024-10-11 11:34:56,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:34:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 122 transitions. [2024-10-11 11:34:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 11:34:56,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:56,441 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:34:56,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:34:56,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:56,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:56,442 INFO L85 PathProgramCache]: Analyzing trace with hash -325184391, now seen corresponding path program 1 times [2024-10-11 11:34:56,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:34:56,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859093617] [2024-10-11 11:34:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:56,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:34:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:34:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:34:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:34:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:34:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:34:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:34:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:35:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:35:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:35:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:35:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:35:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:35:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:35:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:35:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,034 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:35:00,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:00,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859093617] [2024-10-11 11:35:00,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859093617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:00,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:00,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:35:00,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199659131] [2024-10-11 11:35:00,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:00,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:35:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:35:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:35:00,040 INFO L87 Difference]: Start difference. First operand 83 states and 122 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:35:00,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:00,644 INFO L93 Difference]: Finished difference Result 92 states and 130 transitions. [2024-10-11 11:35:00,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:35:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-11 11:35:00,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:00,647 INFO L225 Difference]: With dead ends: 92 [2024-10-11 11:35:00,648 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 11:35:00,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:35:00,649 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 64 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:00,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:35:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 11:35:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2024-10-11 11:35:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.2) internal successors, (60), 50 states have internal predecessors, (60), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:35:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 124 transitions. [2024-10-11 11:35:00,672 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 124 transitions. Word has length 100 [2024-10-11 11:35:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:00,673 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 124 transitions. [2024-10-11 11:35:00,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:35:00,673 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 124 transitions. [2024-10-11 11:35:00,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 11:35:00,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:00,676 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:35:00,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:35:00,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:00,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash -325124809, now seen corresponding path program 1 times [2024-10-11 11:35:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625674847] [2024-10-11 11:35:00,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:00,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:35:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:35:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:35:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:35:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:35:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:35:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:35:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:35:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:00,868 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:35:00,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:00,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625674847] [2024-10-11 11:35:00,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625674847] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:00,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:00,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:35:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488970459] [2024-10-11 11:35:00,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:00,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:35:00,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:00,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:35:00,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:35:00,872 INFO L87 Difference]: Start difference. First operand 85 states and 124 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:35:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:01,011 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2024-10-11 11:35:01,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:35:01,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-11 11:35:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:01,015 INFO L225 Difference]: With dead ends: 209 [2024-10-11 11:35:01,015 INFO L226 Difference]: Without dead ends: 125 [2024-10-11 11:35:01,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:35:01,020 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 42 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:01,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 194 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:35:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-11 11:35:01,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-11 11:35:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 71 states have internal predecessors, (84), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:35:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 180 transitions. [2024-10-11 11:35:01,046 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 180 transitions. Word has length 100 [2024-10-11 11:35:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:01,047 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 180 transitions. [2024-10-11 11:35:01,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:35:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 180 transitions. [2024-10-11 11:35:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 11:35:01,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:01,049 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:35:01,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:35:01,049 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:01,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 564632786, now seen corresponding path program 1 times [2024-10-11 11:35:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190517076] [2024-10-11 11:35:01,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:01,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:35:04,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:35:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:35:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:35:04,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:35:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:35:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:35:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:35:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:04,905 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:35:04,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:04,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190517076] [2024-10-11 11:35:04,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190517076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:04,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:04,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 11:35:04,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604755406] [2024-10-11 11:35:04,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:04,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 11:35:04,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:04,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 11:35:04,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:35:04,910 INFO L87 Difference]: Start difference. First operand 123 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 11:35:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:06,258 INFO L93 Difference]: Finished difference Result 175 states and 239 transitions. [2024-10-11 11:35:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 11:35:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 101 [2024-10-11 11:35:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:06,261 INFO L225 Difference]: With dead ends: 175 [2024-10-11 11:35:06,261 INFO L226 Difference]: Without dead ends: 173 [2024-10-11 11:35:06,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2024-10-11 11:35:06,265 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 135 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:06,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 306 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:35:06,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-10-11 11:35:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 147. [2024-10-11 11:35:06,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 88 states have (on average 1.1818181818181819) internal successors, (104), 89 states have internal predecessors, (104), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 11:35:06,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 212 transitions. [2024-10-11 11:35:06,305 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 212 transitions. Word has length 101 [2024-10-11 11:35:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:06,306 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 212 transitions. [2024-10-11 11:35:06,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 11:35:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 212 transitions. [2024-10-11 11:35:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 11:35:06,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:06,308 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:35:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:35:06,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:06,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 507374484, now seen corresponding path program 1 times [2024-10-11 11:35:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542252374] [2024-10-11 11:35:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:09,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:09,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:09,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:35:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:35:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:35:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:35:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:35:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:35:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:35:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:35:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:09,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-11 11:35:09,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542252374] [2024-10-11 11:35:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542252374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:35:09,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:35:09,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897983016] [2024-10-11 11:35:09,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:09,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:35:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:09,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:35:09,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:35:09,208 INFO L87 Difference]: Start difference. First operand 147 states and 212 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:35:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:09,757 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2024-10-11 11:35:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:35:09,758 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 101 [2024-10-11 11:35:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:09,761 INFO L225 Difference]: With dead ends: 194 [2024-10-11 11:35:09,761 INFO L226 Difference]: Without dead ends: 192 [2024-10-11 11:35:09,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:35:09,762 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 37 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:09,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 306 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:35:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-10-11 11:35:09,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 153. [2024-10-11 11:35:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.1808510638297873) internal successors, (111), 95 states have internal predecessors, (111), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 11:35:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2024-10-11 11:35:09,797 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 101 [2024-10-11 11:35:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:09,798 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2024-10-11 11:35:09,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-11 11:35:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2024-10-11 11:35:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 11:35:09,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:09,802 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:35:09,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:35:09,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1271635853, now seen corresponding path program 1 times [2024-10-11 11:35:09,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:09,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553673921] [2024-10-11 11:35:09,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:09,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:35:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:35:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:35:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:35:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:35:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:35:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:35:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:35:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:35:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:35:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:35:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:35:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:35:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:35:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:35:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:35:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:35:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:35:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:35:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:35:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:35:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 11:35:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 11:35:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 11:35:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:35:10,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553673921] [2024-10-11 11:35:10,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553673921] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:35:10,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688466189] [2024-10-11 11:35:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:10,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:35:10,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:35:10,919 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:35:10,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:35:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:11,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 11:35:11,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:35:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2024-10-11 11:35:11,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:35:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688466189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:35:11,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:35:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-11 11:35:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69064493] [2024-10-11 11:35:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:35:11,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:35:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:35:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:35:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-11 11:35:11,280 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 11:35:11,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:35:11,502 INFO L93 Difference]: Finished difference Result 324 states and 463 transitions. [2024-10-11 11:35:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:35:11,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 200 [2024-10-11 11:35:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:35:11,505 INFO L225 Difference]: With dead ends: 324 [2024-10-11 11:35:11,505 INFO L226 Difference]: Without dead ends: 212 [2024-10-11 11:35:11,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-11 11:35:11,510 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 44 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:35:11,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 193 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:35:11,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-10-11 11:35:11,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 196. [2024-10-11 11:35:11,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 121 states have internal predecessors, (143), 70 states have call successors, (70), 5 states have call predecessors, (70), 5 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:35:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-10-11 11:35:11,541 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 200 [2024-10-11 11:35:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:35:11,542 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-10-11 11:35:11,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 11:35:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-10-11 11:35:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-11 11:35:11,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:35:11,545 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:35:11,563 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:35:11,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:35:11,750 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:35:11,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:35:11,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1328894155, now seen corresponding path program 1 times [2024-10-11 11:35:11,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:35:11,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015628823] [2024-10-11 11:35:11,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:11,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:35:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:35:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:35:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:35:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:35:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:35:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:35:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:35:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:35:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:35:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:35:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:35:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:35:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:35:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:35:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:35:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:35:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:35:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:35:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:35:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:35:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:35:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:35:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:35:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:35:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:35:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:35:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 11:35:12,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-11 11:35:12,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-11 11:35:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-10-11 11:35:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-11 11:35:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-10-11 11:35:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2018 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-11 11:35:12,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:35:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015628823] [2024-10-11 11:35:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015628823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:35:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042619154] [2024-10-11 11:35:12,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:35:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:35:12,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:35:12,118 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:35:12,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:35:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:35:12,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-11 11:35:12,248 INFO L278 TraceCheckSpWp]: Computing forward predicates...