./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_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 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:49:33,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:49:33,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:49:33,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:49:33,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:49:33,285 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:49:33,286 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:49:33,286 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:49:33,287 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:49:33,288 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:49:33,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:49:33,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:49:33,290 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:49:33,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:49:33,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:49:33,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:49:33,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:49:33,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:49:33,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:49:33,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:49:33,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:49:33,296 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:49:33,296 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:49:33,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:49:33,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:49:33,297 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:49:33,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:49:33,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:49:33,298 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:49:33,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:49:33,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:49:33,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:49:33,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:49:33,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:49:33,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:49:33,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:49:33,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:49:33,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:49:33,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:49:33,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:49:33,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:49:33,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:49:33,302 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 -> 5f70a8d930c5557b68c07ef577122d328ec387effee8f919b747045b88161608 [2024-11-20 02:49:33,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:49:33,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:49:33,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:49:33,589 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:49:33,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:49:33,591 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2024-11-20 02:49:35,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:49:35,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:49:35,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-34.i [2024-11-20 02:49:35,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc728c1b1/abc56fc970a449f09c5644eb12afc6c2/FLAG9f53a6c9d [2024-11-20 02:49:35,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc728c1b1/abc56fc970a449f09c5644eb12afc6c2 [2024-11-20 02:49:35,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:49:35,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:49:35,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:49:35,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:49:35,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:49:35,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:49:35" (1/1) ... [2024-11-20 02:49:35,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d819b6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:35, skipping insertion in model container [2024-11-20 02:49:35,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:49:35" (1/1) ... [2024-11-20 02:49:35,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:49:35,864 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2024-11-20 02:49:35,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:49:35,961 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:49:35,974 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_fillercode_fillercodesize_normal_file-34.i[913,926] [2024-11-20 02:49:36,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:49:36,048 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:49:36,049 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36 WrapperNode [2024-11-20 02:49:36,049 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:49:36,050 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:49:36,050 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:49:36,050 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:49:36,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,117 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-20 02:49:36,117 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:49:36,118 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:49:36,118 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:49:36,118 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:49:36,132 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,171 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-20 02:49:36,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,182 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,188 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:49:36,201 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:49:36,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:49:36,202 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:49:36,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (1/1) ... [2024-11-20 02:49:36,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:49:36,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:49:36,239 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-20 02:49:36,243 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-20 02:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:49:36,284 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:49:36,284 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:49:36,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:49:36,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:49:36,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:49:36,349 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:49:36,351 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:49:36,735 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-20 02:49:36,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:49:36,753 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:49:36,754 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:49:36,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:36 BoogieIcfgContainer [2024-11-20 02:49:36,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:49:36,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:49:36,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:49:36,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:49:36,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:49:35" (1/3) ... [2024-11-20 02:49:36,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d68134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:49:36, skipping insertion in model container [2024-11-20 02:49:36,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:49:36" (2/3) ... [2024-11-20 02:49:36,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51d68134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:49:36, skipping insertion in model container [2024-11-20 02:49:36,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:49:36" (3/3) ... [2024-11-20 02:49:36,765 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-34.i [2024-11-20 02:49:36,783 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:49:36,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:49:36,849 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:49:36,854 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;@4f028c54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:49:36,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:49:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 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-20 02:49:36,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 02:49:36,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:36,875 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] [2024-11-20 02:49:36,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:36,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:36,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1167158208, now seen corresponding path program 1 times [2024-11-20 02:49:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:36,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575225196] [2024-11-20 02:49:36,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:36,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:49:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:49:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:49:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:49:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:49:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:49:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:49:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:49:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:49:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:49:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:49:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:49:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:49:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,338 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-20 02:49:37,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:49:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575225196] [2024-11-20 02:49:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575225196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:49:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432599904] [2024-11-20 02:49:37,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:37,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:49:37,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:49:37,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:49:37,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:49:37,369 INFO L87 Difference]: Start difference. First operand has 71 states, 55 states have (on average 1.490909090909091) internal successors, (82), 56 states have internal predecessors, (82), 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 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-20 02:49:37,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:37,395 INFO L93 Difference]: Finished difference Result 135 states and 223 transitions. [2024-11-20 02:49:37,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:49:37,398 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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 94 [2024-11-20 02:49:37,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:37,404 INFO L225 Difference]: With dead ends: 135 [2024-11-20 02:49:37,404 INFO L226 Difference]: Without dead ends: 67 [2024-11-20 02:49:37,408 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-20 02:49:37,411 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:37,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:49:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-20 02:49:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-20 02:49:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 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-20 02:49:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-20 02:49:37,459 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 94 [2024-11-20 02:49:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:37,459 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-20 02:49:37,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 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-20 02:49:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-20 02:49:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 02:49:37,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:37,464 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] [2024-11-20 02:49:37,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:49:37,464 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1294889278, now seen corresponding path program 1 times [2024-11-20 02:49:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73455553] [2024-11-20 02:49:37,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:49:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:49:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:49:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:49:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:49:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:49:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:49:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:49:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:49:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:49:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:49:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:49:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:49:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,026 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-20 02:49:38,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:49:38,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73455553] [2024-11-20 02:49:38,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73455553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:38,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:38,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:49:38,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320860072] [2024-11-20 02:49:38,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:38,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:49:38,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:49:38,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:49:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:49:38,034 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-20 02:49:38,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:38,206 INFO L93 Difference]: Finished difference Result 225 states and 342 transitions. [2024-11-20 02:49:38,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:49:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 94 [2024-11-20 02:49:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:38,211 INFO L225 Difference]: With dead ends: 225 [2024-11-20 02:49:38,211 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 02:49:38,214 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-20 02:49:38,217 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 129 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:38,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 321 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:49:38,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 02:49:38,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 131. [2024-11-20 02:49:38,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.4411764705882353) internal successors, (147), 102 states have internal predecessors, (147), 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-20 02:49:38,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 199 transitions. [2024-11-20 02:49:38,260 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 199 transitions. Word has length 94 [2024-11-20 02:49:38,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:38,261 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 199 transitions. [2024-11-20 02:49:38,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-20 02:49:38,262 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 199 transitions. [2024-11-20 02:49:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 02:49:38,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:38,265 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] [2024-11-20 02:49:38,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:49:38,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:38,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:38,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1947848368, now seen corresponding path program 1 times [2024-11-20 02:49:38,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:38,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723956906] [2024-11-20 02:49:38,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:38,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:49:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:49:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:49:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:49:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:49:38,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:49:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:49:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:49:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:49:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:49:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:49:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:49:38,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:49:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:49:38,703 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-20 02:49:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:49:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723956906] [2024-11-20 02:49:38,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723956906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:49:38,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:49:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:49:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516299222] [2024-11-20 02:49:38,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:49:38,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:49:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:49:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:49:38,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:49:38,709 INFO L87 Difference]: Start difference. First operand 131 states and 199 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-20 02:49:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:49:38,930 INFO L93 Difference]: Finished difference Result 382 states and 580 transitions. [2024-11-20 02:49:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:49:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 95 [2024-11-20 02:49:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:49:38,934 INFO L225 Difference]: With dead ends: 382 [2024-11-20 02:49:38,934 INFO L226 Difference]: Without dead ends: 254 [2024-11-20 02:49:38,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:49:38,936 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 125 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:49:38,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 329 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:49:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-20 02:49:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 135. [2024-11-20 02:49:38,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 106 states have (on average 1.4245283018867925) internal successors, (151), 106 states have internal predecessors, (151), 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-20 02:49:38,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 203 transitions. [2024-11-20 02:49:38,976 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 203 transitions. Word has length 95 [2024-11-20 02:49:38,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:49:38,976 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 203 transitions. [2024-11-20 02:49:38,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-20 02:49:38,977 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 203 transitions. [2024-11-20 02:49:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 02:49:38,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:49:38,978 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-20 02:49:38,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:49:38,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:49:38,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:49:38,980 INFO L85 PathProgramCache]: Analyzing trace with hash 343445546, now seen corresponding path program 1 times [2024-11-20 02:49:38,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:49:38,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293201559] [2024-11-20 02:49:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:49:38,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:49:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:02,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:03,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:03,121 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-20 02:50:03,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293201559] [2024-11-20 02:50:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293201559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:50:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066183949] [2024-11-20 02:50:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:03,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:50:03,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:03,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:50:03,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:50:03,126 INFO L87 Difference]: Start difference. First operand 135 states and 203 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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-20 02:50:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:06,864 INFO L93 Difference]: Finished difference Result 535 states and 786 transitions. [2024-11-20 02:50:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 02:50:06,864 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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-20 02:50:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:06,867 INFO L225 Difference]: With dead ends: 535 [2024-11-20 02:50:06,867 INFO L226 Difference]: Without dead ends: 403 [2024-11-20 02:50:06,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=142, Invalid=508, Unknown=0, NotChecked=0, Total=650 [2024-11-20 02:50:06,870 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 378 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:06,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 586 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 02:50:06,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-20 02:50:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2024-11-20 02:50:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 206 states have (on average 1.4223300970873787) internal successors, (293), 206 states have internal predecessors, (293), 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-20 02:50:06,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 371 transitions. [2024-11-20 02:50:06,908 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 371 transitions. Word has length 96 [2024-11-20 02:50:06,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:06,909 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 371 transitions. [2024-11-20 02:50:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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-20 02:50:06,910 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 371 transitions. [2024-11-20 02:50:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 02:50:06,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:06,911 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-20 02:50:06,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:50:06,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:06,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2118452908, now seen corresponding path program 1 times [2024-11-20 02:50:06,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:06,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790889635] [2024-11-20 02:50:06,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:06,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:08,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:09,072 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-20 02:50:09,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:09,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790889635] [2024-11-20 02:50:09,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790889635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:09,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:09,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:50:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488931570] [2024-11-20 02:50:09,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:50:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:09,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:50:09,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:50:09,077 INFO L87 Difference]: Start difference. First operand 249 states and 371 transitions. Second operand has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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-20 02:50:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:10,238 INFO L93 Difference]: Finished difference Result 608 states and 909 transitions. [2024-11-20 02:50:10,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:50:10,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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-20 02:50:10,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:10,242 INFO L225 Difference]: With dead ends: 608 [2024-11-20 02:50:10,242 INFO L226 Difference]: Without dead ends: 460 [2024-11-20 02:50:10,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:50:10,248 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 362 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:10,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 376 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:50:10,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-20 02:50:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 294. [2024-11-20 02:50:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 251 states have (on average 1.4183266932270917) internal successors, (356), 251 states have internal predecessors, (356), 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-20 02:50:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 434 transitions. [2024-11-20 02:50:10,278 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 434 transitions. Word has length 96 [2024-11-20 02:50:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:10,280 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 434 transitions. [2024-11-20 02:50:10,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 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-20 02:50:10,280 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 434 transitions. [2024-11-20 02:50:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 02:50:10,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:10,285 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-20 02:50:10,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:50:10,286 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:10,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:10,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1023503916, now seen corresponding path program 1 times [2024-11-20 02:50:10,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:10,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257134139] [2024-11-20 02:50:10,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:10,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:14,823 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-20 02:50:14,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257134139] [2024-11-20 02:50:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257134139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 02:50:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106983380] [2024-11-20 02:50:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:50:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:50:14,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:50:14,827 INFO L87 Difference]: Start difference. First operand 294 states and 434 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-20 02:50:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:16,141 INFO L93 Difference]: Finished difference Result 602 states and 884 transitions. [2024-11-20 02:50:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:50:16,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-20 02:50:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:16,144 INFO L225 Difference]: With dead ends: 602 [2024-11-20 02:50:16,145 INFO L226 Difference]: Without dead ends: 456 [2024-11-20 02:50:16,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-20 02:50:16,146 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 366 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:16,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 448 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 02:50:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-20 02:50:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 354. [2024-11-20 02:50:16,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 311 states have (on average 1.459807073954984) internal successors, (454), 311 states have internal predecessors, (454), 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-20 02:50:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 532 transitions. [2024-11-20 02:50:16,170 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 532 transitions. Word has length 96 [2024-11-20 02:50:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:16,171 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 532 transitions. [2024-11-20 02:50:16,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 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-20 02:50:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 532 transitions. [2024-11-20 02:50:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 02:50:16,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:16,173 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-20 02:50:16,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:50:16,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:16,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:16,173 INFO L85 PathProgramCache]: Analyzing trace with hash -926687525, now seen corresponding path program 1 times [2024-11-20 02:50:16,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:16,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684777330] [2024-11-20 02:50:16,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:16,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:17,462 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-20 02:50:17,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:17,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684777330] [2024-11-20 02:50:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684777330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:17,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:50:17,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938389067] [2024-11-20 02:50:17,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:17,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:50:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:50:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:50:17,465 INFO L87 Difference]: Start difference. First operand 354 states and 532 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-20 02:50:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:17,919 INFO L93 Difference]: Finished difference Result 656 states and 980 transitions. [2024-11-20 02:50:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 02:50:17,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-20 02:50:17,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:17,922 INFO L225 Difference]: With dead ends: 656 [2024-11-20 02:50:17,923 INFO L226 Difference]: Without dead ends: 472 [2024-11-20 02:50:17,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:50:17,925 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 156 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:17,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 345 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:50:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-20 02:50:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 360. [2024-11-20 02:50:17,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 317 states have (on average 1.444794952681388) internal successors, (458), 317 states have internal predecessors, (458), 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-20 02:50:17,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 536 transitions. [2024-11-20 02:50:17,959 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 536 transitions. Word has length 96 [2024-11-20 02:50:17,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:17,959 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 536 transitions. [2024-11-20 02:50:17,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 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-20 02:50:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 536 transitions. [2024-11-20 02:50:17,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-20 02:50:17,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:17,963 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-20 02:50:17,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:50:17,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:17,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash -667671704, now seen corresponding path program 1 times [2024-11-20 02:50:17,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:17,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145321213] [2024-11-20 02:50:17,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:17,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:18,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:18,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:18,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:18,260 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-20 02:50:18,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:18,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145321213] [2024-11-20 02:50:18,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145321213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:18,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:18,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:50:18,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665632595] [2024-11-20 02:50:18,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:18,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:50:18,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:50:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:50:18,263 INFO L87 Difference]: Start difference. First operand 360 states and 536 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-20 02:50:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:18,449 INFO L93 Difference]: Finished difference Result 576 states and 859 transitions. [2024-11-20 02:50:18,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:50:18,450 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-20 02:50:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:18,452 INFO L225 Difference]: With dead ends: 576 [2024-11-20 02:50:18,452 INFO L226 Difference]: Without dead ends: 350 [2024-11-20 02:50:18,452 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-20 02:50:18,455 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 81 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:18,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 230 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:50:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-20 02:50:18,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 322. [2024-11-20 02:50:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 279 states have (on average 1.4050179211469533) internal successors, (392), 279 states have internal predecessors, (392), 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-20 02:50:18,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 470 transitions. [2024-11-20 02:50:18,494 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 470 transitions. Word has length 96 [2024-11-20 02:50:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:18,495 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 470 transitions. [2024-11-20 02:50:18,495 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-20 02:50:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 470 transitions. [2024-11-20 02:50:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 02:50:18,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:18,497 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-20 02:50:18,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:50:18,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:18,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:18,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1326331525, now seen corresponding path program 1 times [2024-11-20 02:50:18,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876305338] [2024-11-20 02:50:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:18,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:20,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:20,672 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-20 02:50:20,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:20,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876305338] [2024-11-20 02:50:20,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876305338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:20,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:20,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 02:50:20,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012579824] [2024-11-20 02:50:20,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:20,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 02:50:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:20,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 02:50:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:50:20,675 INFO L87 Difference]: Start difference. First operand 322 states and 470 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 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-20 02:50:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:21,739 INFO L93 Difference]: Finished difference Result 647 states and 936 transitions. [2024-11-20 02:50:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 02:50:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 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-20 02:50:21,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:21,743 INFO L225 Difference]: With dead ends: 647 [2024-11-20 02:50:21,744 INFO L226 Difference]: Without dead ends: 515 [2024-11-20 02:50:21,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:50:21,745 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 260 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:21,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 480 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:50:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-20 02:50:21,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 358. [2024-11-20 02:50:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 313 states have (on average 1.3738019169329074) internal successors, (430), 313 states have internal predecessors, (430), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 02:50:21,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 508 transitions. [2024-11-20 02:50:21,779 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 508 transitions. Word has length 97 [2024-11-20 02:50:21,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:21,780 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 508 transitions. [2024-11-20 02:50:21,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 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-20 02:50:21,780 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 508 transitions. [2024-11-20 02:50:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 02:50:21,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:21,782 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-20 02:50:21,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:50:21,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:21,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash 491239673, now seen corresponding path program 1 times [2024-11-20 02:50:21,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:21,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612221737] [2024-11-20 02:50:21,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:21,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:24,218 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-20 02:50:24,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:24,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612221737] [2024-11-20 02:50:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612221737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 02:50:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690194859] [2024-11-20 02:50:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:24,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 02:50:24,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:24,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 02:50:24,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-20 02:50:24,221 INFO L87 Difference]: Start difference. First operand 358 states and 508 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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-20 02:50:26,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:26,565 INFO L93 Difference]: Finished difference Result 841 states and 1200 transitions. [2024-11-20 02:50:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-20 02:50:26,566 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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-20 02:50:26,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:26,569 INFO L225 Difference]: With dead ends: 841 [2024-11-20 02:50:26,570 INFO L226 Difference]: Without dead ends: 625 [2024-11-20 02:50:26,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2024-11-20 02:50:26,571 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 371 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:26,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 428 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 02:50:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-20 02:50:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 441. [2024-11-20 02:50:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3914141414141414) internal successors, (551), 396 states have internal predecessors, (551), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 02:50:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 629 transitions. [2024-11-20 02:50:26,603 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 629 transitions. Word has length 97 [2024-11-20 02:50:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:26,604 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 629 transitions. [2024-11-20 02:50:26,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 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-20 02:50:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 629 transitions. [2024-11-20 02:50:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 02:50:26,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:26,606 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-20 02:50:26,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:50:26,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:26,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1171298043, now seen corresponding path program 1 times [2024-11-20 02:50:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847072095] [2024-11-20 02:50:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:26,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:32,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:32,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:32,732 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-20 02:50:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:32,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847072095] [2024-11-20 02:50:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847072095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:32,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:32,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:50:32,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194634505] [2024-11-20 02:50:32,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:32,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:50:32,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:32,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:50:32,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:50:32,735 INFO L87 Difference]: Start difference. First operand 441 states and 629 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-20 02:50:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:34,513 INFO L93 Difference]: Finished difference Result 832 states and 1170 transitions. [2024-11-20 02:50:34,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:50:34,514 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 97 [2024-11-20 02:50:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:34,516 INFO L225 Difference]: With dead ends: 832 [2024-11-20 02:50:34,517 INFO L226 Difference]: Without dead ends: 543 [2024-11-20 02:50:34,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2024-11-20 02:50:34,518 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 272 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:34,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 757 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 02:50:34,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2024-11-20 02:50:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 441. [2024-11-20 02:50:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.3888888888888888) internal successors, (550), 396 states have internal predecessors, (550), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 02:50:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 628 transitions. [2024-11-20 02:50:34,548 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 628 transitions. Word has length 97 [2024-11-20 02:50:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:34,548 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 628 transitions. [2024-11-20 02:50:34,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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-20 02:50:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 628 transitions. [2024-11-20 02:50:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:50:34,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:34,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-20 02:50:34,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:50:34,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:34,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1743707403, now seen corresponding path program 1 times [2024-11-20 02:50:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160881167] [2024-11-20 02:50:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:42,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:42,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:42,252 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-20 02:50:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160881167] [2024-11-20 02:50:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160881167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:42,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 02:50:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626438975] [2024-11-20 02:50:42,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:42,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 02:50:42,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:42,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 02:50:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:50:42,255 INFO L87 Difference]: Start difference. First operand 441 states and 628 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 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-20 02:50:44,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:44,465 INFO L93 Difference]: Finished difference Result 785 states and 1112 transitions. [2024-11-20 02:50:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-20 02:50:44,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 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-20 02:50:44,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:44,468 INFO L225 Difference]: With dead ends: 785 [2024-11-20 02:50:44,469 INFO L226 Difference]: Without dead ends: 557 [2024-11-20 02:50:44,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2024-11-20 02:50:44,471 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 356 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:44,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 531 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 02:50:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2024-11-20 02:50:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 421. [2024-11-20 02:50:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 376 states have (on average 1.3936170212765957) internal successors, (524), 376 states have internal predecessors, (524), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 02:50:44,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 602 transitions. [2024-11-20 02:50:44,500 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 602 transitions. Word has length 98 [2024-11-20 02:50:44,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:44,501 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 602 transitions. [2024-11-20 02:50:44,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 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-20 02:50:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 602 transitions. [2024-11-20 02:50:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:50:44,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:44,502 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-20 02:50:44,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 02:50:44,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:44,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1063649033, now seen corresponding path program 1 times [2024-11-20 02:50:44,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:44,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114078303] [2024-11-20 02:50:44,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:44,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:44,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:50:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:50:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:50:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:50:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:50:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:50:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:50:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:50:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:50:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:50:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:50:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:50:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:50:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:50:46,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-20 02:50:46,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:50:46,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114078303] [2024-11-20 02:50:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114078303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:50:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:50:46,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:50:46,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393677907] [2024-11-20 02:50:46,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:50:46,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:50:46,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:50:46,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:50:46,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:50:46,608 INFO L87 Difference]: Start difference. First operand 421 states and 602 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-20 02:50:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:50:47,375 INFO L93 Difference]: Finished difference Result 717 states and 1016 transitions. [2024-11-20 02:50:47,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:50:47,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-20 02:50:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:50:47,379 INFO L225 Difference]: With dead ends: 717 [2024-11-20 02:50:47,379 INFO L226 Difference]: Without dead ends: 485 [2024-11-20 02:50:47,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:50:47,381 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 232 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:50:47,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 338 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:50:47,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-11-20 02:50:47,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 411. [2024-11-20 02:50:47,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 366 states have (on average 1.3934426229508197) internal successors, (510), 366 states have internal predecessors, (510), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-20 02:50:47,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 588 transitions. [2024-11-20 02:50:47,415 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 588 transitions. Word has length 98 [2024-11-20 02:50:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:50:47,415 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 588 transitions. [2024-11-20 02:50:47,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-20 02:50:47,416 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 588 transitions. [2024-11-20 02:50:47,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-20 02:50:47,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:50:47,417 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-20 02:50:47,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 02:50:47,417 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:50:47,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:50:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -448582361, now seen corresponding path program 1 times [2024-11-20 02:50:47,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:50:47,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603004019] [2024-11-20 02:50:47,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:50:47,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:50:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat