./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_operatoramount_amount100_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.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 e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:24:41,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:24:41,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:24:41,822 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:24:41,823 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:24:41,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:24:41,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:24:41,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:24:41,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:24:41,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:24:41,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:24:41,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:24:41,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:24:41,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:24:41,863 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:24:41,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:24:41,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:24:41,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:24:41,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:24:41,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:24:41,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:24:41,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:24:41,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:24:41,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:24:41,866 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:24:41,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:24:41,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:24:41,868 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:24:41,868 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:24:41,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:24:41,869 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:24:41,869 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:24:41,869 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:24:41,870 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:24:41,870 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:24:41,870 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:24:41,870 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:24:41,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:24:41,871 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:24:41,871 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:24:41,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:24:41,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:24:41,872 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 -> e9518b729fb33f0de408129e2e0e3cb97ea8e11de366001cefdd2574471f584b [2024-10-14 12:24:42,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:24:42,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:24:42,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:24:42,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:24:42,203 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:24:42,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-10-14 12:24:43,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:24:43,961 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:24:43,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-92.i [2024-10-14 12:24:43,980 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2186b84/b7e52d5d28cd4c0a81f9783f5a37707b/FLAGa4c7e2654 [2024-10-14 12:24:44,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2186b84/b7e52d5d28cd4c0a81f9783f5a37707b [2024-10-14 12:24:44,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:24:44,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:24:44,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:24:44,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:24:44,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:24:44,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eb1691c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44, skipping insertion in model container [2024-10-14 12:24:44,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:24:44,521 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_operatoramount_amount100_file-92.i[916,929] [2024-10-14 12:24:44,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:24:44,620 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:24:44,638 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_operatoramount_amount100_file-92.i[916,929] [2024-10-14 12:24:44,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:24:44,750 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:24:44,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44 WrapperNode [2024-10-14 12:24:44,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:24:44,752 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:24:44,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:24:44,754 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:24:44,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,782 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,851 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 310 [2024-10-14 12:24:44,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:24:44,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:24:44,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:24:44,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:24:44,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,906 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-14 12:24:44,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,911 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,945 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,953 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:24:44,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:24:44,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:24:44,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:24:44,965 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (1/1) ... [2024-10-14 12:24:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:24:44,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:24:45,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:24:45,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:24:45,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:24:45,053 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:24:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:24:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:24:45,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:24:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:24:45,170 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:24:45,172 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:24:45,867 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-14 12:24:45,868 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:24:45,911 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:24:45,912 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:24:45,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:45 BoogieIcfgContainer [2024-10-14 12:24:45,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:24:45,917 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:24:45,918 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:24:45,921 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:24:45,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:24:44" (1/3) ... [2024-10-14 12:24:45,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23083f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:24:45, skipping insertion in model container [2024-10-14 12:24:45,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:24:44" (2/3) ... [2024-10-14 12:24:45,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23083f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:24:45, skipping insertion in model container [2024-10-14 12:24:45,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:24:45" (3/3) ... [2024-10-14 12:24:45,926 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-92.i [2024-10-14 12:24:45,950 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:24:45,951 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:24:46,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:24:46,028 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;@5562c924, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:24:46,028 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:24:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 96 states have (on average 1.53125) internal successors, (147), 97 states have internal predecessors, (147), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:24:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 12:24:46,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:46,052 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:24:46,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:46,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:46,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1414877071, now seen corresponding path program 1 times [2024-10-14 12:24:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:46,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954718731] [2024-10-14 12:24:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:46,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:24:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:24:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:24:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:24:46,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:24:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 12:24:46,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 12:24:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 12:24:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:46,600 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:24:46,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:46,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954718731] [2024-10-14 12:24:46,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954718731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:24:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753367091] [2024-10-14 12:24:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:46,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:24:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:46,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:24:46,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:24:46,643 INFO L87 Difference]: Start difference. First operand has 121 states, 96 states have (on average 1.53125) internal successors, (147), 97 states have internal predecessors, (147), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 12:24:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:46,692 INFO L93 Difference]: Finished difference Result 239 states and 402 transitions. [2024-10-14 12:24:46,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:24:46,695 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-10-14 12:24:46,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:46,703 INFO L225 Difference]: With dead ends: 239 [2024-10-14 12:24:46,704 INFO L226 Difference]: Without dead ends: 119 [2024-10-14 12:24:46,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-14 12:24:46,710 INFO L432 NwaCegarLoop]: 183 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, 183 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-14 12:24:46,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:24:46,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-14 12:24:46,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-14 12:24:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 95 states have internal predecessors, (142), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 12:24:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 186 transitions. [2024-10-14 12:24:46,759 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 186 transitions. Word has length 155 [2024-10-14 12:24:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:46,760 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 186 transitions. [2024-10-14 12:24:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 12:24:46,760 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 186 transitions. [2024-10-14 12:24:46,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 12:24:46,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:46,766 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:24:46,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:24:46,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash 784344301, now seen corresponding path program 1 times [2024-10-14 12:24:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:46,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887852895] [2024-10-14 12:24:46,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:46,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:46,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:24:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:24:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:24:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:24:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:24:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 12:24:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 12:24:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 12:24:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:47,555 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:24:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887852895] [2024-10-14 12:24:47,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887852895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 12:24:47,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319772842] [2024-10-14 12:24:47,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:47,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 12:24:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:47,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 12:24:47,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 12:24:47,565 INFO L87 Difference]: Start difference. First operand 119 states and 186 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:24:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:47,704 INFO L93 Difference]: Finished difference Result 355 states and 556 transitions. [2024-10-14 12:24:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 12:24:47,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-10-14 12:24:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:47,711 INFO L225 Difference]: With dead ends: 355 [2024-10-14 12:24:47,711 INFO L226 Difference]: Without dead ends: 237 [2024-10-14 12:24:47,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-14 12:24:47,714 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 133 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:47,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 399 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:24:47,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-14 12:24:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2024-10-14 12:24:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 188 states have (on average 1.4893617021276595) internal successors, (280), 188 states have internal predecessors, (280), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 12:24:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 368 transitions. [2024-10-14 12:24:47,769 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 368 transitions. Word has length 155 [2024-10-14 12:24:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:47,769 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 368 transitions. [2024-10-14 12:24:47,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:24:47,770 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 368 transitions. [2024-10-14 12:24:47,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 12:24:47,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:47,773 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:24:47,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:24:47,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:47,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1102764299, now seen corresponding path program 1 times [2024-10-14 12:24:47,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:47,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377326603] [2024-10-14 12:24:47,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:47,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:24:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:24:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:24:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:24:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:48,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:48,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:48,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:24:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 12:24:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 12:24:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 12:24:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:48,441 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:24:48,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377326603] [2024-10-14 12:24:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377326603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:48,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:48,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:24:48,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782977189] [2024-10-14 12:24:48,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:48,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:24:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:48,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:24:48,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:24:48,448 INFO L87 Difference]: Start difference. First operand 235 states and 368 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:24:48,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:48,890 INFO L93 Difference]: Finished difference Result 1019 states and 1575 transitions. [2024-10-14 12:24:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 12:24:48,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-10-14 12:24:48,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:48,902 INFO L225 Difference]: With dead ends: 1019 [2024-10-14 12:24:48,903 INFO L226 Difference]: Without dead ends: 785 [2024-10-14 12:24:48,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 12:24:48,908 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 477 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:48,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 697 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 12:24:48,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2024-10-14 12:24:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 483. [2024-10-14 12:24:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 390 states have (on average 1.5025641025641026) internal successors, (586), 390 states have internal predecessors, (586), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-14 12:24:48,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 762 transitions. [2024-10-14 12:24:48,989 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 762 transitions. Word has length 156 [2024-10-14 12:24:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:48,991 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 762 transitions. [2024-10-14 12:24:48,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:24:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 762 transitions. [2024-10-14 12:24:48,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 12:24:48,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:48,996 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:24:48,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:24:48,997 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash 702674035, now seen corresponding path program 1 times [2024-10-14 12:24:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:49,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127715089] [2024-10-14 12:24:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:49,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:24:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:24:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:24:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:24:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:24:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:24:49,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:24:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:24:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:24:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:24:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:24:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:24:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:24:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:24:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:24:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:24:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:24:49,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:24:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 12:24:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 12:24:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:24:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 12:24:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:24:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:24:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:24:49,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127715089] [2024-10-14 12:24:49,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127715089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:24:49,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:24:49,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 12:24:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912363738] [2024-10-14 12:24:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:24:49,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 12:24:49,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:24:49,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 12:24:49,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 12:24:49,800 INFO L87 Difference]: Start difference. First operand 483 states and 762 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:24:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:24:50,999 INFO L93 Difference]: Finished difference Result 1259 states and 1958 transitions. [2024-10-14 12:24:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:24:51,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-10-14 12:24:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:24:51,012 INFO L225 Difference]: With dead ends: 1259 [2024-10-14 12:24:51,012 INFO L226 Difference]: Without dead ends: 1017 [2024-10-14 12:24:51,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 12:24:51,016 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1091 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:24:51,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1017 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 12:24:51,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2024-10-14 12:24:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 619. [2024-10-14 12:24:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 505 states have (on average 1.502970297029703) internal successors, (759), 506 states have internal predecessors, (759), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 12:24:51,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 975 transitions. [2024-10-14 12:24:51,119 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 975 transitions. Word has length 156 [2024-10-14 12:24:51,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:24:51,120 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 975 transitions. [2024-10-14 12:24:51,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:24:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 975 transitions. [2024-10-14 12:24:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 12:24:51,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:24:51,123 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:24:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:24:51,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:24:51,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:24:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 599599868, now seen corresponding path program 1 times [2024-10-14 12:24:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:24:51,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101164411] [2024-10-14 12:24:51,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:24:51,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:24:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:25:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:25:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:25:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:25:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:25:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:25:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 12:25:21,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:25:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 12:25:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 12:25:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 12:25:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 12:25:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 12:25:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 12:25:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 12:25:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 12:25:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 12:25:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 12:25:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 12:25:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 12:25:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 12:25:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 12:25:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:25:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 12:25:21,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:25:21,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101164411] [2024-10-14 12:25:21,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101164411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:25:21,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:25:21,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 12:25:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392137689] [2024-10-14 12:25:21,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:25:21,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 12:25:21,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:25:21,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 12:25:21,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 12:25:21,507 INFO L87 Difference]: Start difference. First operand 619 states and 975 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:25:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:25:25,999 INFO L93 Difference]: Finished difference Result 1921 states and 2993 transitions. [2024-10-14 12:25:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 12:25:26,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 156 [2024-10-14 12:25:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:25:26,012 INFO L225 Difference]: With dead ends: 1921 [2024-10-14 12:25:26,013 INFO L226 Difference]: Without dead ends: 1303 [2024-10-14 12:25:26,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:25:26,017 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 426 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:25:26,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 522 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 12:25:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2024-10-14 12:25:26,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 794. [2024-10-14 12:25:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 680 states have (on average 1.526470588235294) internal successors, (1038), 681 states have internal predecessors, (1038), 108 states have call successors, (108), 5 states have call predecessors, (108), 5 states have return successors, (108), 107 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 12:25:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1254 transitions. [2024-10-14 12:25:26,087 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1254 transitions. Word has length 156 [2024-10-14 12:25:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:25:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1254 transitions. [2024-10-14 12:25:26,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 12:25:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1254 transitions. [2024-10-14 12:25:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 12:25:26,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:25:26,092 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 12:25:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:25:26,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:25:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:25:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1022301694, now seen corresponding path program 1 times [2024-10-14 12:25:26,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:25:26,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5204578] [2024-10-14 12:25:26,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:25:26,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:25:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat