./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.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_operatoramount_amount50_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:52:15,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:52:15,193 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:52:15,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:52:15,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:52:15,219 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:52:15,220 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:52:15,220 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:52:15,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:52:15,221 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:52:15,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:52:15,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:52:15,223 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:52:15,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:52:15,223 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:52:15,224 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:52:15,224 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:52:15,225 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:52:15,225 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:52:15,225 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:52:15,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:52:15,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:52:15,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:52:15,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:52:15,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:52:15,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:52:15,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:52:15,229 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:52:15,229 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:52:15,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:52:15,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:52:15,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:52:15,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:52:15,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:52:15,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:52:15,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:52:15,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:52:15,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:52:15,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:52:15,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:52:15,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:52:15,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:52:15,233 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 -> 6879d183ea614705b8dec9095f843a55526481f961ca46c6ec00dfff8309d4ce [2024-11-10 08:52:15,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:52:15,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:52:15,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:52:15,531 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:52:15,531 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:52:15,532 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-10 08:52:16,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:52:17,199 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:52:17,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-34.i [2024-11-10 08:52:17,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408d89e74/d0c56738a6294fcbadf1a0a9e5e518cc/FLAG37f1de395 [2024-11-10 08:52:17,223 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/408d89e74/d0c56738a6294fcbadf1a0a9e5e518cc [2024-11-10 08:52:17,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:52:17,230 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:52:17,231 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:52:17,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:52:17,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:52:17,236 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20584140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17, skipping insertion in model container [2024-11-10 08:52:17,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,266 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:52:17,465 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_operatoramount_amount50_file-34.i[915,928] [2024-11-10 08:52:17,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:52:17,537 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:52:17,547 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_operatoramount_amount50_file-34.i[915,928] [2024-11-10 08:52:17,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:52:17,609 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:52:17,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17 WrapperNode [2024-11-10 08:52:17,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:52:17,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:52:17,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:52:17,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:52:17,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,627 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,666 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-10 08:52:17,666 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:52:17,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:52:17,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:52:17,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:52:17,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,713 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 08:52:17,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,725 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,730 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:52:17,737 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:52:17,737 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:52:17,737 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:52:17,738 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (1/1) ... [2024-11-10 08:52:17,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:52:17,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:52:17,776 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 08:52:17,779 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 08:52:17,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:52:17,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:52:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:52:17,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:52:17,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:52:17,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:52:17,914 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:52:17,917 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:52:18,297 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L125: havoc property_#t~bitwise13#1;havoc property_#t~ite15#1;havoc property_#t~bitwise14#1;havoc property_#t~short16#1; [2024-11-10 08:52:18,331 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-10 08:52:18,331 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:52:18,357 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:52:18,358 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:52:18,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:52:18 BoogieIcfgContainer [2024-11-10 08:52:18,359 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:52:18,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:52:18,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:52:18,364 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:52:18,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:52:17" (1/3) ... [2024-11-10 08:52:18,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694f4883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:52:18, skipping insertion in model container [2024-11-10 08:52:18,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:52:17" (2/3) ... [2024-11-10 08:52:18,365 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@694f4883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:52:18, skipping insertion in model container [2024-11-10 08:52:18,365 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:52:18" (3/3) ... [2024-11-10 08:52:18,366 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-34.i [2024-11-10 08:52:18,379 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:52:18,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:52:18,441 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:52:18,449 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;@554c6b52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:52:18,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:52:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:52:18,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:52:18,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:18,469 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:18,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:18,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1116078717, now seen corresponding path program 1 times [2024-11-10 08:52:18,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:18,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034013782] [2024-11-10 08:52:18,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:18,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:18,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:18,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:18,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034013782] [2024-11-10 08:52:18,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034013782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:18,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:18,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:52:18,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355776910] [2024-11-10 08:52:18,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:18,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:52:18,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:18,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:52:18,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:52:18,942 INFO L87 Difference]: Start difference. First operand has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 59 states have internal predecessors, (85), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:52:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:18,983 INFO L93 Difference]: Finished difference Result 140 states and 228 transitions. [2024-11-10 08:52:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:52:18,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-11-10 08:52:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:18,995 INFO L225 Difference]: With dead ends: 140 [2024-11-10 08:52:18,996 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 08:52:19,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:52:19,005 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:19,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:52:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 08:52:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 08:52:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-10 08:52:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 103 transitions. [2024-11-10 08:52:19,058 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 103 transitions. Word has length 96 [2024-11-10 08:52:19,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:19,058 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 103 transitions. [2024-11-10 08:52:19,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:52:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 103 transitions. [2024-11-10 08:52:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 08:52:19,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:19,064 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:19,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:52:19,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:19,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash -948426654, now seen corresponding path program 1 times [2024-11-10 08:52:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:19,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003762155] [2024-11-10 08:52:19,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:19,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:19,646 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:19,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003762155] [2024-11-10 08:52:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003762155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:52:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912190775] [2024-11-10 08:52:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:19,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:52:19,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:19,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:52:19,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:52:19,654 INFO L87 Difference]: Start difference. First operand 69 states and 103 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:19,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:19,843 INFO L93 Difference]: Finished difference Result 233 states and 350 transitions. [2024-11-10 08:52:19,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:52:19,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2024-11-10 08:52:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:19,847 INFO L225 Difference]: With dead ends: 233 [2024-11-10 08:52:19,847 INFO L226 Difference]: Without dead ends: 167 [2024-11-10 08:52:19,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:52:19,849 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 133 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:19,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 314 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:52:19,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-10 08:52:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 134. [2024-11-10 08:52:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:52:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 202 transitions. [2024-11-10 08:52:19,884 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 202 transitions. Word has length 96 [2024-11-10 08:52:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:19,885 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 202 transitions. [2024-11-10 08:52:19,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 202 transitions. [2024-11-10 08:52:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 08:52:19,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:19,892 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:19,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:52:19,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:19,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:19,893 INFO L85 PathProgramCache]: Analyzing trace with hash 377050540, now seen corresponding path program 1 times [2024-11-10 08:52:19,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658638825] [2024-11-10 08:52:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:20,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:20,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658638825] [2024-11-10 08:52:20,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658638825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:20,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:20,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:52:20,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283635975] [2024-11-10 08:52:20,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:20,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:52:20,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:20,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:52:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:52:20,256 INFO L87 Difference]: Start difference. First operand 134 states and 202 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:20,497 INFO L93 Difference]: Finished difference Result 392 states and 590 transitions. [2024-11-10 08:52:20,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:52:20,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 97 [2024-11-10 08:52:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:20,502 INFO L225 Difference]: With dead ends: 392 [2024-11-10 08:52:20,502 INFO L226 Difference]: Without dead ends: 261 [2024-11-10 08:52:20,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:52:20,505 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 138 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:20,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 396 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:52:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-10 08:52:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 138. [2024-11-10 08:52:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 109 states have internal predecessors, (154), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 08:52:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2024-11-10 08:52:20,545 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 206 transitions. Word has length 97 [2024-11-10 08:52:20,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:20,548 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 206 transitions. [2024-11-10 08:52:20,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:20,549 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 206 transitions. [2024-11-10 08:52:20,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:52:20,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:20,550 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:20,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:52:20,554 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:20,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 729838885, now seen corresponding path program 1 times [2024-11-10 08:52:20,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:20,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013674070] [2024-11-10 08:52:20,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:20,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:23,321 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:23,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:23,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013674070] [2024-11-10 08:52:23,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013674070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:23,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:23,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:52:23,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112059257] [2024-11-10 08:52:23,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:23,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:52:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:52:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:52:23,328 INFO L87 Difference]: Start difference. First operand 138 states and 206 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:23,802 INFO L93 Difference]: Finished difference Result 441 states and 653 transitions. [2024-11-10 08:52:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 08:52:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-10 08:52:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:23,806 INFO L225 Difference]: With dead ends: 441 [2024-11-10 08:52:23,806 INFO L226 Difference]: Without dead ends: 306 [2024-11-10 08:52:23,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:52:23,808 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:23,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 298 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 08:52:23,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-10 08:52:23,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 186. [2024-11-10 08:52:23,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 143 states have (on average 1.3986013986013985) internal successors, (200), 143 states have internal predecessors, (200), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 08:52:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2024-11-10 08:52:23,848 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 98 [2024-11-10 08:52:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:23,849 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2024-11-10 08:52:23,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2024-11-10 08:52:23,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:52:23,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:23,850 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:23,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:52:23,851 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:23,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:23,854 INFO L85 PathProgramCache]: Analyzing trace with hash -62336342, now seen corresponding path program 1 times [2024-11-10 08:52:23,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:23,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646594530] [2024-11-10 08:52:23,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:23,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:32,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646594530] [2024-11-10 08:52:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646594530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 08:52:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004865515] [2024-11-10 08:52:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:32,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 08:52:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 08:52:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:52:32,552 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:34,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:34,732 INFO L93 Difference]: Finished difference Result 600 states and 868 transitions. [2024-11-10 08:52:34,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 08:52:34,733 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-10 08:52:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:34,737 INFO L225 Difference]: With dead ends: 600 [2024-11-10 08:52:34,737 INFO L226 Difference]: Without dead ends: 448 [2024-11-10 08:52:34,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2024-11-10 08:52:34,740 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 652 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:34,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 603 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 08:52:34,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-10 08:52:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 263. [2024-11-10 08:52:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 220 states have (on average 1.4136363636363636) internal successors, (311), 220 states have internal predecessors, (311), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 08:52:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 389 transitions. [2024-11-10 08:52:34,764 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 389 transitions. Word has length 98 [2024-11-10 08:52:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:34,765 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 389 transitions. [2024-11-10 08:52:34,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 389 transitions. [2024-11-10 08:52:34,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:52:34,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:34,769 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:34,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:52:34,770 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:34,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1680473993, now seen corresponding path program 1 times [2024-11-10 08:52:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:34,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013049505] [2024-11-10 08:52:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:34,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:37,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:37,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:37,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:37,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013049505] [2024-11-10 08:52:37,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013049505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:37,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:37,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:52:37,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681700125] [2024-11-10 08:52:37,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:37,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:52:37,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:37,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:52:37,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:52:37,595 INFO L87 Difference]: Start difference. First operand 263 states and 389 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:39,285 INFO L93 Difference]: Finished difference Result 637 states and 941 transitions. [2024-11-10 08:52:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:52:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-10 08:52:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:39,289 INFO L225 Difference]: With dead ends: 637 [2024-11-10 08:52:39,289 INFO L226 Difference]: Without dead ends: 486 [2024-11-10 08:52:39,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:52:39,291 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 393 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:39,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 397 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 08:52:39,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-11-10 08:52:39,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 311. [2024-11-10 08:52:39,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 268 states have (on average 1.4029850746268657) internal successors, (376), 268 states have internal predecessors, (376), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 08:52:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 454 transitions. [2024-11-10 08:52:39,320 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 454 transitions. Word has length 98 [2024-11-10 08:52:39,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:39,321 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 454 transitions. [2024-11-10 08:52:39,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 454 transitions. [2024-11-10 08:52:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:52:39,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:39,326 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:39,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:52:39,326 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:39,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:39,326 INFO L85 PathProgramCache]: Analyzing trace with hash -258849847, now seen corresponding path program 1 times [2024-11-10 08:52:39,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:39,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840664438] [2024-11-10 08:52:39,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:39,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:40,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:40,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:40,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:40,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840664438] [2024-11-10 08:52:40,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840664438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:40,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:40,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 08:52:40,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352716405] [2024-11-10 08:52:40,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:40,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 08:52:40,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:40,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 08:52:40,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:52:40,608 INFO L87 Difference]: Start difference. First operand 311 states and 454 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:52:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:41,436 INFO L93 Difference]: Finished difference Result 638 states and 922 transitions. [2024-11-10 08:52:41,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:52:41,436 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 98 [2024-11-10 08:52:41,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:41,439 INFO L225 Difference]: With dead ends: 638 [2024-11-10 08:52:41,439 INFO L226 Difference]: Without dead ends: 489 [2024-11-10 08:52:41,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:52:41,441 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 470 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:41,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 431 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:52:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-10 08:52:41,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 373. [2024-11-10 08:52:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 330 states have (on average 1.4333333333333333) internal successors, (473), 330 states have internal predecessors, (473), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 08:52:41,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 551 transitions. [2024-11-10 08:52:41,464 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 551 transitions. Word has length 98 [2024-11-10 08:52:41,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:41,465 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 551 transitions. [2024-11-10 08:52:41,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-10 08:52:41,465 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 551 transitions. [2024-11-10 08:52:41,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:52:41,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:41,467 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:41,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:52:41,467 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:41,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:41,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2057576602, now seen corresponding path program 1 times [2024-11-10 08:52:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:41,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380386220] [2024-11-10 08:52:41,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:41,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:41,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380386220] [2024-11-10 08:52:41,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380386220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:41,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:41,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:52:41,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881069338] [2024-11-10 08:52:41,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:41,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:52:41,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:41,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:52:41,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:52:41,738 INFO L87 Difference]: Start difference. First operand 373 states and 551 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:41,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:41,932 INFO L93 Difference]: Finished difference Result 597 states and 883 transitions. [2024-11-10 08:52:41,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:52:41,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-10 08:52:41,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:41,936 INFO L225 Difference]: With dead ends: 597 [2024-11-10 08:52:41,936 INFO L226 Difference]: Without dead ends: 368 [2024-11-10 08:52:41,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:52:41,938 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 84 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:41,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 234 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:52:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-10 08:52:41,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 337. [2024-11-10 08:52:41,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 294 states have (on average 1.3911564625850341) internal successors, (409), 294 states have internal predecessors, (409), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-10 08:52:41,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 487 transitions. [2024-11-10 08:52:41,968 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 487 transitions. Word has length 98 [2024-11-10 08:52:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:41,970 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 487 transitions. [2024-11-10 08:52:41,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 487 transitions. [2024-11-10 08:52:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 08:52:41,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:41,972 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:41,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:52:41,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:41,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:41,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1290973355, now seen corresponding path program 1 times [2024-11-10 08:52:41,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:41,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643478313] [2024-11-10 08:52:41,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:41,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:52:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:52:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:52:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:52:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:52:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:52:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:52:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:52:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:52:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:52:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:52:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:52:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:52:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:52:43,763 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:52:43,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:52:43,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643478313] [2024-11-10 08:52:43,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643478313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:52:43,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:52:43,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 08:52:43,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565463483] [2024-11-10 08:52:43,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:52:43,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 08:52:43,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:52:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 08:52:43,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:52:43,765 INFO L87 Difference]: Start difference. First operand 337 states and 487 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:52:45,414 INFO L93 Difference]: Finished difference Result 659 states and 946 transitions. [2024-11-10 08:52:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 08:52:45,414 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 98 [2024-11-10 08:52:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:52:45,417 INFO L225 Difference]: With dead ends: 659 [2024-11-10 08:52:45,417 INFO L226 Difference]: Without dead ends: 591 [2024-11-10 08:52:45,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:52:45,419 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 405 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:52:45,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 957 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 08:52:45,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-10 08:52:45,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 438. [2024-11-10 08:52:45,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 381 states have (on average 1.3805774278215224) internal successors, (526), 381 states have internal predecessors, (526), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 08:52:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 630 transitions. [2024-11-10 08:52:45,461 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 630 transitions. Word has length 98 [2024-11-10 08:52:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:52:45,462 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 630 transitions. [2024-11-10 08:52:45,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:52:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 630 transitions. [2024-11-10 08:52:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:52:45,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:52:45,463 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:52:45,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 08:52:45,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:52:45,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:52:45,464 INFO L85 PathProgramCache]: Analyzing trace with hash -2063595760, now seen corresponding path program 1 times [2024-11-10 08:52:45,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:52:45,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795321447] [2024-11-10 08:52:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:52:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:52:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:53:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:53:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:53:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:53:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:53:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:53:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:53:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:53:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:53:11,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:53:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:53:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:53:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:53:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:53:11,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:53:11,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795321447] [2024-11-10 08:53:11,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795321447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:53:11,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:53:11,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:53:11,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219375315] [2024-11-10 08:53:11,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:53:11,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:53:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:53:11,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:53:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:53:11,951 INFO L87 Difference]: Start difference. First operand 438 states and 630 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:53:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:53:12,588 INFO L93 Difference]: Finished difference Result 933 states and 1344 transitions. [2024-11-10 08:53:12,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:53:12,589 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-10 08:53:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:53:12,592 INFO L225 Difference]: With dead ends: 933 [2024-11-10 08:53:12,592 INFO L226 Difference]: Without dead ends: 727 [2024-11-10 08:53:12,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:53:12,594 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 304 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:53:12,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 713 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 08:53:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-10 08:53:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 549. [2024-11-10 08:53:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 485 states have (on average 1.3814432989690721) internal successors, (670), 486 states have internal predecessors, (670), 57 states have call successors, (57), 6 states have call predecessors, (57), 6 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-10 08:53:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 784 transitions. [2024-11-10 08:53:12,631 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 784 transitions. Word has length 99 [2024-11-10 08:53:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:53:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 784 transitions. [2024-11-10 08:53:12,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:53:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 784 transitions. [2024-11-10 08:53:12,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:53:12,633 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:53:12,633 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:53:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 08:53:12,634 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:53:12,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:53:12,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1234299183, now seen corresponding path program 1 times [2024-11-10 08:53:12,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:53:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210232484] [2024-11-10 08:53:12,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:53:12,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:53:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:53:37,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:53:37,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-10 08:53:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:53:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 08:53:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:53:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 08:53:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:53:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-10 08:53:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:53:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-10 08:53:37,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:53:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-10 08:53:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:53:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 08:53:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:53:37,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210232484] [2024-11-10 08:53:37,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210232484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:53:37,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:53:37,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 08:53:37,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501513559] [2024-11-10 08:53:37,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:53:37,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 08:53:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:53:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 08:53:37,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:53:37,598 INFO L87 Difference]: Start difference. First operand 549 states and 784 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:53:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:53:38,196 INFO L93 Difference]: Finished difference Result 925 states and 1327 transitions. [2024-11-10 08:53:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:53:38,197 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 99 [2024-11-10 08:53:38,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:53:38,200 INFO L225 Difference]: With dead ends: 925 [2024-11-10 08:53:38,203 INFO L226 Difference]: Without dead ends: 742 [2024-11-10 08:53:38,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:53:38,204 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 266 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:53:38,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 1050 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 08:53:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-11-10 08:53:38,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 536. [2024-11-10 08:53:38,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 477 states have (on average 1.3773584905660377) internal successors, (657), 477 states have internal predecessors, (657), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-10 08:53:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 761 transitions. [2024-11-10 08:53:38,240 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 761 transitions. Word has length 99 [2024-11-10 08:53:38,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:53:38,240 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 761 transitions. [2024-11-10 08:53:38,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-10 08:53:38,241 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 761 transitions. [2024-11-10 08:53:38,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 08:53:38,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:53:38,242 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:53:38,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 08:53:38,243 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:53:38,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:53:38,243 INFO L85 PathProgramCache]: Analyzing trace with hash -401630282, now seen corresponding path program 1 times [2024-11-10 08:53:38,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:53:38,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799305511] [2024-11-10 08:53:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:53:38,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:53:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat