./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.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_floatingpointinfluence_no-floats_file-6.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 39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:57:32,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:57:32,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:57:32,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:57:32,869 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:57:32,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:57:32,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:57:32,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:57:32,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:57:32,903 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:57:32,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:57:32,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:57:32,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:57:32,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:57:32,909 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:57:32,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:57:32,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:57:32,913 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:57:32,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:57:32,913 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:57:32,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:57:32,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:57:32,915 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:57:32,915 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:57:32,915 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:57:32,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:57:32,916 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:57:32,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:57:32,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:57:32,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:57:32,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:57:32,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:57:32,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:57:32,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:57:32,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:57:32,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:57:32,922 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:57:32,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:57:32,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:57:32,923 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:57:32,923 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:57:32,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:57:32,925 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 -> 39503444fac790cc7ef077fbcc4f712a5a3d8e4f2da830986fe4863c2c197175 [2024-10-11 10:57:33,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:57:33,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:57:33,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:57:33,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:57:33,195 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:57:33,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i [2024-10-11 10:57:34,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:57:34,956 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:57:34,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i [2024-10-11 10:57:34,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d8079a30/0fdeab1a26834c418d1d5f452d600247/FLAG80b0122e0 [2024-10-11 10:57:34,986 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6d8079a30/0fdeab1a26834c418d1d5f452d600247 [2024-10-11 10:57:34,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:57:34,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:57:34,992 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:57:34,992 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:57:34,998 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:57:35,001 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:57:34" (1/1) ... [2024-10-11 10:57:35,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e34619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35, skipping insertion in model container [2024-10-11 10:57:35,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:57:34" (1/1) ... [2024-10-11 10:57:35,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:57:35,208 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i[915,928] [2024-10-11 10:57:35,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:57:35,294 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:57:35,308 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-6.i[915,928] [2024-10-11 10:57:35,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:57:35,376 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:57:35,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35 WrapperNode [2024-10-11 10:57:35,377 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:57:35,378 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:57:35,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:57:35,381 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:57:35,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,398 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,435 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 133 [2024-10-11 10:57:35,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:57:35,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:57:35,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:57:35,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:57:35,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,478 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 10:57:35,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,492 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,494 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:57:35,499 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:57:35,499 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:57:35,499 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:57:35,500 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (1/1) ... [2024-10-11 10:57:35,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:57:35,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:57:35,545 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 10:57:35,548 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 10:57:35,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:57:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:57:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:57:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:57:35,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:57:35,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:57:35,687 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:57:35,689 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:57:36,019 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 10:57:36,020 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:57:36,076 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:57:36,077 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:57:36,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:57:36 BoogieIcfgContainer [2024-10-11 10:57:36,080 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:57:36,083 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:57:36,083 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:57:36,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:57:36,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:57:34" (1/3) ... [2024-10-11 10:57:36,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3265c7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:57:36, skipping insertion in model container [2024-10-11 10:57:36,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:57:35" (2/3) ... [2024-10-11 10:57:36,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3265c7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:57:36, skipping insertion in model container [2024-10-11 10:57:36,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:57:36" (3/3) ... [2024-10-11 10:57:36,092 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-6.i [2024-10-11 10:57:36,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:57:36,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:57:36,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:57:36,175 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;@76fee860, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:57:36,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:57:36,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:57:36,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:57:36,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:57:36,194 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:36,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:57:36,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:57:36,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1727841666, now seen corresponding path program 1 times [2024-10-11 10:57:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:57:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551322694] [2024-10-11 10:57:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:57:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:57:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:57:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:57:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:57:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:57:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:57:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:57:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:57:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:57:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:57:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:57:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:57:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:57:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:57:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:57:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:57:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:57:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:57:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:57:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:57:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:57:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:57:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:57:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:57:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:57:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:57:36,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551322694] [2024-10-11 10:57:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551322694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:57:36,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:57:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:57:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611013958] [2024-10-11 10:57:36,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:57:36,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:57:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:57:36,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:57:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:57:36,728 INFO L87 Difference]: Start difference. First operand has 54 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 29 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 10:57:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:57:36,766 INFO L93 Difference]: Finished difference Result 105 states and 191 transitions. [2024-10-11 10:57:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:57:36,768 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 136 [2024-10-11 10:57:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:57:36,778 INFO L225 Difference]: With dead ends: 105 [2024-10-11 10:57:36,780 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 10:57:36,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 10:57:36,790 INFO L432 NwaCegarLoop]: 77 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, 77 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 10:57:36,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:57:36,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 10:57:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 10:57:36,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:57:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 80 transitions. [2024-10-11 10:57:36,845 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 80 transitions. Word has length 136 [2024-10-11 10:57:36,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:57:36,845 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 80 transitions. [2024-10-11 10:57:36,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-11 10:57:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 80 transitions. [2024-10-11 10:57:36,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:57:36,851 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:57:36,852 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:36,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:57:36,855 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:57:36,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:57:36,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1982930436, now seen corresponding path program 1 times [2024-10-11 10:57:36,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:57:36,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138131399] [2024-10-11 10:57:36,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:57:36,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:57:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:57:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:57:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:57:37,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:57:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:57:37,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:57:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:57:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:57:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:57:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:57:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:57:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:57:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:57:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:57:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:57:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:57:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:57:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:57:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:57:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:57:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:57:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:57:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:57:37,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:57:37,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:57:37,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138131399] [2024-10-11 10:57:37,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138131399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:57:37,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:57:37,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:57:37,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265645499] [2024-10-11 10:57:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:57:37,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:57:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:57:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:57:37,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:57:37,490 INFO L87 Difference]: Start difference. First operand 52 states and 80 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:57:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:57:37,642 INFO L93 Difference]: Finished difference Result 103 states and 159 transitions. [2024-10-11 10:57:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:57:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-11 10:57:37,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:57:37,645 INFO L225 Difference]: With dead ends: 103 [2024-10-11 10:57:37,645 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 10:57:37,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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 10:57:37,647 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:57:37,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 75 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:57:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 10:57:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 10:57:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-11 10:57:37,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 79 transitions. [2024-10-11 10:57:37,669 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 79 transitions. Word has length 136 [2024-10-11 10:57:37,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:57:37,671 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 79 transitions. [2024-10-11 10:57:37,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:57:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 79 transitions. [2024-10-11 10:57:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:57:37,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:57:37,678 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:37,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:57:37,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:57:37,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:57:37,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1925672134, now seen corresponding path program 1 times [2024-10-11 10:57:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:57:37,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414117614] [2024-10-11 10:57:37,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:57:37,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:57:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:57:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:57:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:57:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:57:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:57:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:57:37,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:57:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:57:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:57:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:57:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:57:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:57:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:57:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:57:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:57:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:57:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:57:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:57:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:57:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:57:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:57:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:57:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:57:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:38,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:57:38,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:57:38,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414117614] [2024-10-11 10:57:38,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414117614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:57:38,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:57:38,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:57:38,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196961680] [2024-10-11 10:57:38,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:57:38,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 10:57:38,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:57:38,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 10:57:38,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:57:38,047 INFO L87 Difference]: Start difference. First operand 52 states and 79 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:57:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:57:38,120 INFO L93 Difference]: Finished difference Result 140 states and 211 transitions. [2024-10-11 10:57:38,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 10:57:38,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-11 10:57:38,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:57:38,125 INFO L225 Difference]: With dead ends: 140 [2024-10-11 10:57:38,125 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 10:57:38,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 10:57:38,129 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:57:38,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 184 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 10:57:38,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 10:57:38,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-10-11 10:57:38,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 45 states have (on average 1.2) internal successors, (54), 46 states have internal predecessors, (54), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:57:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 130 transitions. [2024-10-11 10:57:38,161 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 130 transitions. Word has length 136 [2024-10-11 10:57:38,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:57:38,162 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 130 transitions. [2024-10-11 10:57:38,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:57:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 130 transitions. [2024-10-11 10:57:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 10:57:38,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:57:38,166 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:57:38,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:57:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:57:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash -150664772, now seen corresponding path program 1 times [2024-10-11 10:57:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:57:38,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067074505] [2024-10-11 10:57:38,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:57:38,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:57:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:57:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:57:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:57:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:57:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:57:48,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:57:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:57:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:57:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:57:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:57:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:57:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:57:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:57:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:57:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:57:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:57:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:57:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:57:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:57:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:57:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:57:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:57:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:57:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:57:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:57:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:57:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067074505] [2024-10-11 10:57:48,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067074505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:57:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:57:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 10:57:48,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472093573] [2024-10-11 10:57:48,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:57:48,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:57:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:57:48,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:57:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:57:48,295 INFO L87 Difference]: Start difference. First operand 86 states and 130 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:57:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:57:51,488 INFO L93 Difference]: Finished difference Result 95 states and 138 transitions. [2024-10-11 10:57:51,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:57:51,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 136 [2024-10-11 10:57:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:57:51,492 INFO L225 Difference]: With dead ends: 95 [2024-10-11 10:57:51,496 INFO L226 Difference]: Without dead ends: 93 [2024-10-11 10:57:51,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:57:51,498 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 27 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:57:51,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 265 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:57:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-11 10:57:51,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2024-10-11 10:57:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 48 states have internal predecessors, (56), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:57:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 132 transitions. [2024-10-11 10:57:51,524 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 132 transitions. Word has length 136 [2024-10-11 10:57:51,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:57:51,527 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 132 transitions. [2024-10-11 10:57:51,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:57:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 132 transitions. [2024-10-11 10:57:51,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 10:57:51,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:57:51,529 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:57:51,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:57:51,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:57:51,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:57:51,531 INFO L85 PathProgramCache]: Analyzing trace with hash 628194866, now seen corresponding path program 1 times [2024-10-11 10:57:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:57:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833394756] [2024-10-11 10:57:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:57:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:57:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:58:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:58:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:58:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:58:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:58:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:58:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:58:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:58:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:58:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:58:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:58:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:00,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:58:00,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833394756] [2024-10-11 10:58:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833394756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:00,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:58:00,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381456542] [2024-10-11 10:58:00,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:58:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:58:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:58:00,567 INFO L87 Difference]: Start difference. First operand 88 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:02,628 INFO L93 Difference]: Finished difference Result 108 states and 154 transitions. [2024-10-11 10:58:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:58:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2024-10-11 10:58:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:02,631 INFO L225 Difference]: With dead ends: 108 [2024-10-11 10:58:02,631 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 10:58:02,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:02,636 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 39 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:02,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 329 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 10:58:02,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 10:58:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2024-10-11 10:58:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:58:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-10-11 10:58:02,669 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 137 [2024-10-11 10:58:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:02,670 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-10-11 10:58:02,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-10-11 10:58:02,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 10:58:02,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:02,672 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:02,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 10:58:02,672 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:02,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash -181151760, now seen corresponding path program 1 times [2024-10-11 10:58:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:02,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610040579] [2024-10-11 10:58:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:58:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:58:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:58:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:58:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:58:06,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:58:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:58:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:06,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:58:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:58:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:58:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:58:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:58:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:06,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610040579] [2024-10-11 10:58:06,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610040579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:06,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:06,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 10:58:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792367130] [2024-10-11 10:58:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:06,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 10:58:06,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:06,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 10:58:06,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:58:06,685 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:07,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:07,755 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2024-10-11 10:58:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 10:58:07,757 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2024-10-11 10:58:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:07,759 INFO L225 Difference]: With dead ends: 109 [2024-10-11 10:58:07,759 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 10:58:07,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:58:07,761 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 36 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:07,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 232 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:58:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 10:58:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2024-10-11 10:58:07,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.183673469387755) internal successors, (58), 50 states have internal predecessors, (58), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 10:58:07,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2024-10-11 10:58:07,778 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 137 [2024-10-11 10:58:07,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:07,779 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2024-10-11 10:58:07,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2024-10-11 10:58:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 10:58:07,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:07,780 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:07,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 10:58:07,781 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:07,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:07,781 INFO L85 PathProgramCache]: Analyzing trace with hash -385519683, now seen corresponding path program 1 times [2024-10-11 10:58:07,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:07,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680086438] [2024-10-11 10:58:07,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:07,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:58:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:58:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:58:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:58:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:58:08,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:08,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:58:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:58:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:58:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:58:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:58:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:58:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:58:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:08,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680086438] [2024-10-11 10:58:08,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680086438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:08,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:08,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:58:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954513027] [2024-10-11 10:58:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:08,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:58:08,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:58:08,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:58:08,403 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:08,875 INFO L93 Difference]: Finished difference Result 244 states and 362 transitions. [2024-10-11 10:58:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:58:08,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2024-10-11 10:58:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:08,878 INFO L225 Difference]: With dead ends: 244 [2024-10-11 10:58:08,879 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 10:58:08,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 10:58:08,883 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:08,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 246 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 10:58:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 141. [2024-10-11 10:58:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-11 10:58:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 212 transitions. [2024-10-11 10:58:08,932 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 212 transitions. Word has length 137 [2024-10-11 10:58:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:08,933 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 212 transitions. [2024-10-11 10:58:08,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:08,933 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 212 transitions. [2024-10-11 10:58:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 10:58:08,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:08,934 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:08,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 10:58:08,935 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:08,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:08,935 INFO L85 PathProgramCache]: Analyzing trace with hash -385460101, now seen corresponding path program 1 times [2024-10-11 10:58:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:08,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297901717] [2024-10-11 10:58:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:08,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:58:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:58:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:58:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:58:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:58:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:58:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:58:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:58:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:11,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:58:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:12,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:58:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:58:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:12,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:58:12,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:12,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297901717] [2024-10-11 10:58:12,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297901717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:12,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133842167] [2024-10-11 10:58:12,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:12,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:12,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:12,009 INFO L87 Difference]: Start difference. First operand 141 states and 212 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:13,615 INFO L93 Difference]: Finished difference Result 238 states and 352 transitions. [2024-10-11 10:58:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 10:58:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 137 [2024-10-11 10:58:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:13,618 INFO L225 Difference]: With dead ends: 238 [2024-10-11 10:58:13,619 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 10:58:13,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-10-11 10:58:13,620 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 77 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:13,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 267 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 10:58:13,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 10:58:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 228. [2024-10-11 10:58:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 123 states have (on average 1.1869918699186992) internal successors, (146), 125 states have internal predecessors, (146), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 10:58:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 344 transitions. [2024-10-11 10:58:13,685 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 344 transitions. Word has length 137 [2024-10-11 10:58:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:13,686 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 344 transitions. [2024-10-11 10:58:13,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:13,686 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 344 transitions. [2024-10-11 10:58:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 10:58:13,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:13,688 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:13,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 10:58:13,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:13,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:13,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2010674681, now seen corresponding path program 1 times [2024-10-11 10:58:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:13,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888605029] [2024-10-11 10:58:13,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:13,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:16,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:58:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:58:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:58:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:58:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:58:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:58:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:58:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:58:16,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:58:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:58:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:58:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:16,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:58:16,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:16,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888605029] [2024-10-11 10:58:16,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888605029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:16,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:16,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797955177] [2024-10-11 10:58:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:16,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:16,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:16,842 INFO L87 Difference]: Start difference. First operand 228 states and 344 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:17,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:17,226 INFO L93 Difference]: Finished difference Result 248 states and 365 transitions. [2024-10-11 10:58:17,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 10:58:17,227 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2024-10-11 10:58:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:17,229 INFO L225 Difference]: With dead ends: 248 [2024-10-11 10:58:17,229 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 10:58:17,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:58:17,230 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 47 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:17,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 272 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 10:58:17,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 10:58:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 232. [2024-10-11 10:58:17,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 127 states have (on average 1.1968503937007875) internal successors, (152), 129 states have internal predecessors, (152), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 10:58:17,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 350 transitions. [2024-10-11 10:58:17,283 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 350 transitions. Word has length 138 [2024-10-11 10:58:17,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:17,284 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 350 transitions. [2024-10-11 10:58:17,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:17,285 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 350 transitions. [2024-10-11 10:58:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 10:58:17,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:17,286 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:17,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 10:58:17,287 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:17,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:17,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2010615099, now seen corresponding path program 1 times [2024-10-11 10:58:17,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:17,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810205016] [2024-10-11 10:58:17,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:17,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:37,003 WARN L286 SmtUtils]: Spent 17.54s on a formula simplification. DAG size of input: 124 DAG size of output: 123 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 10:58:38,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:58:38,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:58:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:58:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:58:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:58:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:58:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:58:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:58:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:58:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:58:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:58:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:58:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:58:38,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:58:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:58:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:58:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:58:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:58:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:58:38,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:58:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:58:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:58:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:58:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:58:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:58:38,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:58:38,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810205016] [2024-10-11 10:58:38,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810205016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:58:38,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:58:38,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 10:58:38,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613310638] [2024-10-11 10:58:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:58:38,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 10:58:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:58:38,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 10:58:38,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2024-10-11 10:58:38,260 INFO L87 Difference]: Start difference. First operand 232 states and 350 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:52,559 WARN L286 SmtUtils]: Spent 14.03s on a formula simplification. DAG size of input: 153 DAG size of output: 147 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-11 10:58:53,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:58:53,337 INFO L93 Difference]: Finished difference Result 246 states and 363 transitions. [2024-10-11 10:58:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 10:58:53,338 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 138 [2024-10-11 10:58:53,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:58:53,350 INFO L225 Difference]: With dead ends: 246 [2024-10-11 10:58:53,350 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 10:58:53,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2024-10-11 10:58:53,351 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 53 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 10:58:53,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 257 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 10:58:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 10:58:53,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 232. [2024-10-11 10:58:53,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 127 states have (on average 1.1968503937007875) internal successors, (152), 129 states have internal predecessors, (152), 99 states have call successors, (99), 5 states have call predecessors, (99), 5 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-11 10:58:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 350 transitions. [2024-10-11 10:58:53,390 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 350 transitions. Word has length 138 [2024-10-11 10:58:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:58:53,390 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 350 transitions. [2024-10-11 10:58:53,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-11 10:58:53,391 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 350 transitions. [2024-10-11 10:58:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 10:58:53,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:58:53,392 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:58:53,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 10:58:53,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:58:53,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:58:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1475005571, now seen corresponding path program 1 times [2024-10-11 10:58:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:58:53,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616992588] [2024-10-11 10:58:53,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:58:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:58:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:59:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:59:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 10:59:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:59:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 10:59:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:59:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 10:59:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 10:59:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 10:59:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 10:59:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 10:59:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 10:59:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 10:59:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 10:59:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 10:59:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 10:59:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 10:59:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 10:59:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 10:59:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 10:59:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 10:59:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 10:59:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 10:59:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:59:00,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-11 10:59:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:59:00,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616992588] [2024-10-11 10:59:00,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616992588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:59:00,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:59:00,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 10:59:00,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370376263] [2024-10-11 10:59:00,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:59:00,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 10:59:00,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:59:00,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 10:59:00,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-11 10:59:00,254 INFO L87 Difference]: Start difference. First operand 232 states and 350 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23)