./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 129eb72cba2ec6662c92062b72f302d538a3dfe4c41c05f2b8937451c2edd34a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:05:06,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:05:06,377 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:05:06,382 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:05:06,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:05:06,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:05:06,427 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:05:06,427 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:05:06,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:05:06,428 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:05:06,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:05:06,429 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:05:06,429 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:05:06,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:05:06,430 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:05:06,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:05:06,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:05:06,431 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:05:06,431 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:05:06,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:05:06,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:05:06,436 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:05:06,436 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:05:06,437 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:05:06,437 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:05:06,437 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:05:06,437 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:05:06,438 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:05:06,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:05:06,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:05:06,442 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:05:06,442 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:05:06,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:05:06,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:05:06,443 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:05:06,443 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:05:06,443 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:05:06,443 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:05:06,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:05:06,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:05:06,444 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:05:06,444 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:05:06,444 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 129eb72cba2ec6662c92062b72f302d538a3dfe4c41c05f2b8937451c2edd34a [2024-11-10 07:05:06,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:05:06,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:05:06,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:05:06,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:05:06,798 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:05:06,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i [2024-11-10 07:05:08,311 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:05:08,523 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:05:08,524 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i [2024-11-10 07:05:08,535 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa8a5e42/fb31c6aa26024b3991d833b65ccf2222/FLAG135825347 [2024-11-10 07:05:08,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa8a5e42/fb31c6aa26024b3991d833b65ccf2222 [2024-11-10 07:05:08,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:05:08,553 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:05:08,555 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:05:08,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:05:08,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:05:08,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:08,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f482f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08, skipping insertion in model container [2024-11-10 07:05:08,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:08,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:05:08,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i[916,929] [2024-11-10 07:05:08,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:05:08,836 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:05:08,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-57.i[916,929] [2024-11-10 07:05:08,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:05:08,921 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:05:08,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08 WrapperNode [2024-11-10 07:05:08,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:05:08,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:05:08,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:05:08,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:05:08,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:08,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,015 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-11-10 07:05:09,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:05:09,016 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:05:09,016 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:05:09,016 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:05:09,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,032 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,063 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-11-10 07:05:09,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:05:09,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:05:09,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:05:09,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:05:09,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (1/1) ... [2024-11-10 07:05:09,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:05:09,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:05:09,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:05:09,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:05:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:05:09,195 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:05:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:05:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:05:09,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:05:09,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:05:09,277 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:05:09,280 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:05:09,681 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L223: havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2024-11-10 07:05:09,720 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-11-10 07:05:09,720 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:05:09,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:05:09,744 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:05:09,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:09 BoogieIcfgContainer [2024-11-10 07:05:09,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:05:09,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:05:09,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:05:09,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:05:09,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:05:08" (1/3) ... [2024-11-10 07:05:09,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f22a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:05:09, skipping insertion in model container [2024-11-10 07:05:09,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:05:08" (2/3) ... [2024-11-10 07:05:09,752 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f22a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:05:09, skipping insertion in model container [2024-11-10 07:05:09,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:05:09" (3/3) ... [2024-11-10 07:05:09,753 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-57.i [2024-11-10 07:05:09,768 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:05:09,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:05:09,821 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:05:09,830 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;@575d2c39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:05:09,831 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:05:09,838 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 75 states have (on average 1.44) internal successors, (108), 76 states have internal predecessors, (108), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 07:05:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 07:05:09,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:09,857 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:05:09,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:09,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -892532819, now seen corresponding path program 1 times [2024-11-10 07:05:09,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:09,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511558211] [2024-11-10 07:05:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:09,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:10,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:05:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:05:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:05:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:05:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:05:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:05:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:05:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:05:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:05:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:05:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:05:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:05:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:05:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:05:10,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 07:05:10,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:05:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 07:05:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 07:05:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 07:05:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 07:05:10,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 07:05:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 07:05:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:10,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511558211] [2024-11-10 07:05:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511558211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:10,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:10,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:05:10,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030670915] [2024-11-10 07:05:10,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:05:10,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:10,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:05:10,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:05:10,449 INFO L87 Difference]: Start difference. First operand has 114 states, 75 states have (on average 1.44) internal successors, (108), 76 states have internal predecessors, (108), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 07:05:10,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:10,496 INFO L93 Difference]: Finished difference Result 224 states and 392 transitions. [2024-11-10 07:05:10,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:05:10,498 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 229 [2024-11-10 07:05:10,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:10,507 INFO L225 Difference]: With dead ends: 224 [2024-11-10 07:05:10,508 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 07:05:10,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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-11-10 07:05:10,517 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:10,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:05:10,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 07:05:10,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-10 07:05:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 07:05:10,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 172 transitions. [2024-11-10 07:05:10,564 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 172 transitions. Word has length 229 [2024-11-10 07:05:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:05:10,565 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 172 transitions. [2024-11-10 07:05:10,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 07:05:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 172 transitions. [2024-11-10 07:05:10,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 07:05:10,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:10,571 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:05:10,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:05:10,573 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:10,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1155790351, now seen corresponding path program 1 times [2024-11-10 07:05:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583258345] [2024-11-10 07:05:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:11,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:05:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:05:11,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:05:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:05:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:05:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:05:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:05:11,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:05:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:05:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:05:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:05:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:05:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:05:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:05:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 07:05:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:05:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 07:05:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 07:05:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 07:05:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 07:05:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 07:05:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:11,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 07:05:11,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:11,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583258345] [2024-11-10 07:05:11,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583258345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:11,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:11,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:05:11,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878039094] [2024-11-10 07:05:11,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:11,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:05:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:05:11,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:05:11,782 INFO L87 Difference]: Start difference. First operand 109 states and 172 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 07:05:12,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:12,282 INFO L93 Difference]: Finished difference Result 355 states and 563 transitions. [2024-11-10 07:05:12,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:05:12,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 229 [2024-11-10 07:05:12,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:12,287 INFO L225 Difference]: With dead ends: 355 [2024-11-10 07:05:12,287 INFO L226 Difference]: Without dead ends: 249 [2024-11-10 07:05:12,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:05:12,290 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 164 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:12,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 611 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:05:12,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-10 07:05:12,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 210. [2024-11-10 07:05:12,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 135 states have (on average 1.3925925925925926) internal successors, (188), 135 states have internal predecessors, (188), 72 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-10 07:05:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 332 transitions. [2024-11-10 07:05:12,351 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 332 transitions. Word has length 229 [2024-11-10 07:05:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:05:12,353 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 332 transitions. [2024-11-10 07:05:12,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-11-10 07:05:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 332 transitions. [2024-11-10 07:05:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 07:05:12,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:12,359 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:05:12,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:05:12,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:12,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1894412464, now seen corresponding path program 1 times [2024-11-10 07:05:12,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:12,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142867791] [2024-11-10 07:05:12,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:12,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:05:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:05:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:05:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:05:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:05:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:05:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:05:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:05:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:05:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:05:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:05:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:05:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:05:46,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:05:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:05:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:05:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:05:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:05:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:05:46,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:05:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:05:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:05:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:05:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:05:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:05:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:05:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:05:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:05:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:05:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 07:05:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:05:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 07:05:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 07:05:46,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 07:05:46,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 07:05:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 07:05:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:05:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 07:05:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:05:46,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142867791] [2024-11-10 07:05:46,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142867791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:05:46,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:05:46,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 07:05:46,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899032667] [2024-11-10 07:05:46,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:05:46,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:05:46,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:05:46,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:05:46,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:05:46,863 INFO L87 Difference]: Start difference. First operand 210 states and 332 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 07:05:52,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:05:52,405 INFO L93 Difference]: Finished difference Result 713 states and 1110 transitions. [2024-11-10 07:05:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 07:05:52,405 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 229 [2024-11-10 07:05:52,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:05:52,411 INFO L225 Difference]: With dead ends: 713 [2024-11-10 07:05:52,411 INFO L226 Difference]: Without dead ends: 607 [2024-11-10 07:05:52,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2024-11-10 07:05:52,417 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1317 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 07:05:52,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 832 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 07:05:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-11-10 07:05:52,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 296. [2024-11-10 07:05:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 184 states have (on average 1.3695652173913044) internal successors, (252), 184 states have internal predecessors, (252), 108 states have call successors, (108), 3 states have call predecessors, (108), 3 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 07:05:52,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 468 transitions. [2024-11-10 07:05:52,467 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 468 transitions. Word has length 229 [2024-11-10 07:05:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:05:52,468 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 468 transitions. [2024-11-10 07:05:52,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 07:05:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 468 transitions. [2024-11-10 07:05:52,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 07:05:52,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:05:52,472 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:05:52,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:05:52,472 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:05:52,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:05:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1601009457, now seen corresponding path program 1 times [2024-11-10 07:05:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:05:52,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771242553] [2024-11-10 07:05:52,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:05:52,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:05:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:06:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:06:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:06:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:06:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:06:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:06:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:06:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:06:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:06:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 07:06:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:06:26,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 07:06:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 07:06:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 07:06:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 07:06:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 07:06:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-10 07:06:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 07:06:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-10 07:06:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 07:06:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-10 07:06:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 07:06:26,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-10 07:06:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 07:06:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 07:06:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 07:06:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 07:06:26,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 07:06:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 07:06:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 07:06:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 07:06:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-10 07:06:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-10 07:06:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-10 07:06:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-10 07:06:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-10 07:06:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:06:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-10 07:06:26,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:06:26,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771242553] [2024-11-10 07:06:26,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771242553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:06:26,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:06:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 07:06:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691679482] [2024-11-10 07:06:26,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:06:26,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 07:06:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:06:26,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 07:06:26,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-10 07:06:26,703 INFO L87 Difference]: Start difference. First operand 296 states and 468 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 07:06:31,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:06:31,872 INFO L93 Difference]: Finished difference Result 732 states and 1138 transitions. [2024-11-10 07:06:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 07:06:31,873 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 229 [2024-11-10 07:06:31,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:06:31,878 INFO L225 Difference]: With dead ends: 732 [2024-11-10 07:06:31,878 INFO L226 Difference]: Without dead ends: 626 [2024-11-10 07:06:31,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2024-11-10 07:06:31,880 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1307 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:06:31,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 889 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 07:06:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-10 07:06:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 299. [2024-11-10 07:06:31,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 187 states have (on average 1.374331550802139) internal successors, (257), 187 states have internal predecessors, (257), 108 states have call successors, (108), 3 states have call predecessors, (108), 3 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-10 07:06:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 473 transitions. [2024-11-10 07:06:31,922 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 473 transitions. Word has length 229 [2024-11-10 07:06:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:06:31,924 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 473 transitions. [2024-11-10 07:06:31,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-10 07:06:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 473 transitions. [2024-11-10 07:06:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-10 07:06:31,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:06:31,926 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 07:06:31,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:06:31,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:06:31,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:06:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 215241811, now seen corresponding path program 1 times [2024-11-10 07:06:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:06:31,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208393487] [2024-11-10 07:06:31,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:06:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:06:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat