./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_fillercodestructure_filler-ps-co_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:34:03,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:34:03,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:34:03,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:34:03,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:34:03,226 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:34:03,227 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:34:03,227 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:34:03,228 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:34:03,228 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:34:03,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:34:03,229 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:34:03,229 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:34:03,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:34:03,231 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:34:03,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:34:03,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:34:03,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:34:03,232 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:34:03,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:34:03,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:34:03,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:34:03,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:34:03,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:34:03,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:34:03,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:34:03,236 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:34:03,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:34:03,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:34:03,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:34:03,237 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:34:03,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:34:03,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:34:03,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:34:03,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:34:03,238 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:34:03,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:34:03,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:34:03,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:34:03,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:34:03,238 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:34:03,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:34:03,240 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2024-10-14 10:34:03,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:34:03,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:34:03,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:34:03,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:34:03,454 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:34:03,455 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-14 10:34:04,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:34:04,829 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:34:04,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-14 10:34:04,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55aafd956/097a1bff0c854f2f8c1e7c82113cae38/FLAG71727f14e [2024-10-14 10:34:04,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55aafd956/097a1bff0c854f2f8c1e7c82113cae38 [2024-10-14 10:34:04,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:34:04,854 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:34:04,856 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:34:04,856 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:34:04,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:34:04,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:34:04" (1/1) ... [2024-10-14 10:34:04,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bfde8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:04, skipping insertion in model container [2024-10-14 10:34:04,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:34:04" (1/1) ... [2024-10-14 10:34:04,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:34:05,007 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-10-14 10:34:05,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:34:05,074 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:34:05,082 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i[919,932] [2024-10-14 10:34:05,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:34:05,153 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:34:05,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05 WrapperNode [2024-10-14 10:34:05,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:34:05,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:34:05,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:34:05,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:34:05,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,189 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-10-14 10:34:05,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:34:05,190 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:34:05,190 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:34:05,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:34:05,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,217 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:34:05,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,227 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:34:05,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:34:05,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:34:05,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:34:05,232 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (1/1) ... [2024-10-14 10:34:05,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:34:05,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:34:05,266 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:34:05,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:34:05,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:34:05,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:34:05,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:34:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:34:05,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:34:05,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:34:05,374 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:34:05,376 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:34:05,697 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 10:34:05,697 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:34:05,740 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:34:05,740 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:34:05,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:05 BoogieIcfgContainer [2024-10-14 10:34:05,741 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:34:05,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:34:05,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:34:05,746 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:34:05,746 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:34:04" (1/3) ... [2024-10-14 10:34:05,747 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8d05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:34:05, skipping insertion in model container [2024-10-14 10:34:05,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:34:05" (2/3) ... [2024-10-14 10:34:05,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e8d05f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:34:05, skipping insertion in model container [2024-10-14 10:34:05,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:34:05" (3/3) ... [2024-10-14 10:34:05,749 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2024-10-14 10:34:05,763 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:34:05,763 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:34:05,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:34:05,821 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;@4630dc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:34:05,821 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:34:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 10:34:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 10:34:05,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:05,837 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:05,837 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:05,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:05,843 INFO L85 PathProgramCache]: Analyzing trace with hash -649338097, now seen corresponding path program 1 times [2024-10-14 10:34:05,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754639781] [2024-10-14 10:34:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:34:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:34:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:34:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:34:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:34:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:34:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:34:06,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:34:06,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:34:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:34:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:34:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:34:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:34:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:34:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:34:06,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:34:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:34:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:34:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:34:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:34:06,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:34:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:34:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:34:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:34:06,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:06,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754639781] [2024-10-14 10:34:06,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754639781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:06,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:06,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:34:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562354] [2024-10-14 10:34:06,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:06,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:34:06,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:06,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:34:06,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:34:06,253 INFO L87 Difference]: Start difference. First operand has 79 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 53 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 10:34:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:06,287 INFO L93 Difference]: Finished difference Result 155 states and 278 transitions. [2024-10-14 10:34:06,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:34:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2024-10-14 10:34:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:06,299 INFO L225 Difference]: With dead ends: 155 [2024-10-14 10:34:06,299 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 10:34:06,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:34:06,332 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:06,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:06,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 10:34:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-14 10:34:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 51 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-14 10:34:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2024-10-14 10:34:06,400 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 123 transitions. Word has length 157 [2024-10-14 10:34:06,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:06,401 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 123 transitions. [2024-10-14 10:34:06,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-14 10:34:06,402 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 123 transitions. [2024-10-14 10:34:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 10:34:06,408 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:06,408 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:06,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:34:06,409 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:06,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:06,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1055475765, now seen corresponding path program 1 times [2024-10-14 10:34:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444147995] [2024-10-14 10:34:06,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:06,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:34:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:34:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:34:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:34:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:34:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:34:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:34:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:34:06,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:34:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:34:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:34:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:34:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:34:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:34:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:34:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:34:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:34:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:34:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:34:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:34:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:34:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:34:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:34:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:06,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:34:06,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:06,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444147995] [2024-10-14 10:34:06,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444147995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:06,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:06,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:34:06,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844845737] [2024-10-14 10:34:06,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:06,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:34:06,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:06,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:34:06,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:06,743 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:06,815 INFO L93 Difference]: Finished difference Result 229 states and 367 transitions. [2024-10-14 10:34:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:34:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-14 10:34:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:06,819 INFO L225 Difference]: With dead ends: 229 [2024-10-14 10:34:06,819 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 10:34:06,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:06,821 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 80 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:06,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 237 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:34:06,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 10:34:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-10-14 10:34:06,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 100 states have (on average 1.47) internal successors, (147), 100 states have internal predecessors, (147), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 10:34:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 243 transitions. [2024-10-14 10:34:06,849 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 243 transitions. Word has length 157 [2024-10-14 10:34:06,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:06,850 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 243 transitions. [2024-10-14 10:34:06,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 243 transitions. [2024-10-14 10:34:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-14 10:34:06,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:06,852 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:06,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:34:06,852 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1873124215, now seen corresponding path program 1 times [2024-10-14 10:34:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:06,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608321626] [2024-10-14 10:34:06,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:06,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:34:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:34:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:34:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:34:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:34:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:34:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:34:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:34:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:34:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:34:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:34:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:34:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:34:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:34:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:34:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:34:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:34:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:34:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:34:07,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:34:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:34:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:34:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:34:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:34:07,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:07,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608321626] [2024-10-14 10:34:07,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608321626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:07,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:07,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:34:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220732723] [2024-10-14 10:34:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:07,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:34:07,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:07,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:34:07,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:34:07,219 INFO L87 Difference]: Start difference. First operand 151 states and 243 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:07,527 INFO L93 Difference]: Finished difference Result 547 states and 884 transitions. [2024-10-14 10:34:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:34:07,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-10-14 10:34:07,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:07,531 INFO L225 Difference]: With dead ends: 547 [2024-10-14 10:34:07,532 INFO L226 Difference]: Without dead ends: 397 [2024-10-14 10:34:07,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:34:07,534 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 203 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:07,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 402 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:34:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-14 10:34:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2024-10-14 10:34:07,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 216 states have (on average 1.412037037037037) internal successors, (305), 216 states have internal predecessors, (305), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-10-14 10:34:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 545 transitions. [2024-10-14 10:34:07,591 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 545 transitions. Word has length 157 [2024-10-14 10:34:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:07,591 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 545 transitions. [2024-10-14 10:34:07,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 545 transitions. [2024-10-14 10:34:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:34:07,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:07,594 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:07,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:34:07,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:07,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:07,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1692744837, now seen corresponding path program 1 times [2024-10-14 10:34:07,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:07,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52416796] [2024-10-14 10:34:07,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:07,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:34:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:34:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:34:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:34:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:34:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:34:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:34:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:34:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:34:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:34:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:34:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:34:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:34:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:34:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:34:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:34:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:34:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:34:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:34:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:34:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:34:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:34:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:34:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:07,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:34:07,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:07,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52416796] [2024-10-14 10:34:07,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52416796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:07,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:34:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898023921] [2024-10-14 10:34:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:07,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:34:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:07,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:34:07,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:07,882 INFO L87 Difference]: Start difference. First operand 342 states and 545 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:07,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:07,965 INFO L93 Difference]: Finished difference Result 510 states and 819 transitions. [2024-10-14 10:34:07,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:34:07,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-14 10:34:07,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:07,968 INFO L225 Difference]: With dead ends: 510 [2024-10-14 10:34:07,968 INFO L226 Difference]: Without dead ends: 216 [2024-10-14 10:34:07,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:34:07,973 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 59 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:07,974 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 211 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:34:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-10-14 10:34:07,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2024-10-14 10:34:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-14 10:34:08,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 315 transitions. [2024-10-14 10:34:08,005 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 315 transitions. Word has length 158 [2024-10-14 10:34:08,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:08,007 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 315 transitions. [2024-10-14 10:34:08,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:08,007 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 315 transitions. [2024-10-14 10:34:08,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:34:08,012 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:08,012 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:08,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:34:08,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:08,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:08,013 INFO L85 PathProgramCache]: Analyzing trace with hash -247709273, now seen corresponding path program 1 times [2024-10-14 10:34:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:08,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649195519] [2024-10-14 10:34:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:34:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:34:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:34:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:34:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:34:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:34:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:34:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:34:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:34:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:34:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:34:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:34:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:34:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:34:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:34:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:34:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:34:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:34:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:34:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:34:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:34:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:34:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:34:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:34:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:34:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:34:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:34:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649195519] [2024-10-14 10:34:31,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649195519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:34:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:34:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 10:34:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518887497] [2024-10-14 10:34:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:34:31,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 10:34:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:34:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 10:34:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:34:31,520 INFO L87 Difference]: Start difference. First operand 198 states and 315 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:32,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:34:32,551 INFO L93 Difference]: Finished difference Result 508 states and 793 transitions. [2024-10-14 10:34:32,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 10:34:32,554 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-14 10:34:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:34:32,556 INFO L225 Difference]: With dead ends: 508 [2024-10-14 10:34:32,556 INFO L226 Difference]: Without dead ends: 358 [2024-10-14 10:34:32,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:34:32,558 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 193 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:34:32,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 446 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:34:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-14 10:34:32,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 268. [2024-10-14 10:34:32,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.434065934065934) internal successors, (261), 184 states have internal predecessors, (261), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-14 10:34:32,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2024-10-14 10:34:32,577 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 158 [2024-10-14 10:34:32,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:34:32,578 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2024-10-14 10:34:32,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:34:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2024-10-14 10:34:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:34:32,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:34:32,581 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:34:32,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:34:32,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:34:32,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:34:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash -247649691, now seen corresponding path program 1 times [2024-10-14 10:34:32,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:34:32,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395846707] [2024-10-14 10:34:32,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:34:32,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:34:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:35:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:35:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:35:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:35:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:35:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:35:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:35:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:35:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:35:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:35:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:35:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:35:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:35:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:35:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:35:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:35:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:35:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:35:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:35:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:35:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:35:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:35:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:35:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:35:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:00,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:35:00,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:35:00,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395846707] [2024-10-14 10:35:00,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395846707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:00,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:00,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 10:35:00,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231692768] [2024-10-14 10:35:00,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:00,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 10:35:00,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:35:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 10:35:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:35:00,956 INFO L87 Difference]: Start difference. First operand 268 states and 421 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:35:02,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:02,007 INFO L93 Difference]: Finished difference Result 347 states and 525 transitions. [2024-10-14 10:35:02,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 10:35:02,008 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-14 10:35:02,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:02,010 INFO L225 Difference]: With dead ends: 347 [2024-10-14 10:35:02,010 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 10:35:02,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:35:02,011 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 171 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:02,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 556 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:35:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 10:35:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 268. [2024-10-14 10:35:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 182 states have (on average 1.434065934065934) internal successors, (261), 184 states have internal predecessors, (261), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-14 10:35:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 421 transitions. [2024-10-14 10:35:02,031 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 421 transitions. Word has length 158 [2024-10-14 10:35:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:02,031 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 421 transitions. [2024-10-14 10:35:02,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:35:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 421 transitions. [2024-10-14 10:35:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:35:02,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:02,033 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:35:02,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:35:02,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:02,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:02,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1057055899, now seen corresponding path program 1 times [2024-10-14 10:35:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:35:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993596757] [2024-10-14 10:35:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:35:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:35:38,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:35:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:35:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:35:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:35:38,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:35:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:35:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:35:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:35:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:35:38,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:35:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 10:35:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:35:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 10:35:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:35:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 10:35:38,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:35:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 10:35:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:35:38,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 10:35:38,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:35:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 10:35:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:35:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 10:35:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:35:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-14 10:35:38,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:35:38,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993596757] [2024-10-14 10:35:38,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993596757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:35:38,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:35:38,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 10:35:38,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156550906] [2024-10-14 10:35:38,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:35:38,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 10:35:38,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:35:38,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 10:35:38,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-10-14 10:35:38,388 INFO L87 Difference]: Start difference. First operand 268 states and 421 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:35:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:35:39,677 INFO L93 Difference]: Finished difference Result 327 states and 499 transitions. [2024-10-14 10:35:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 10:35:39,678 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-10-14 10:35:39,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:35:39,681 INFO L225 Difference]: With dead ends: 327 [2024-10-14 10:35:39,681 INFO L226 Difference]: Without dead ends: 325 [2024-10-14 10:35:39,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-10-14 10:35:39,682 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 154 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:35:39,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 414 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:35:39,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2024-10-14 10:35:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 273. [2024-10-14 10:35:39,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 187 states have (on average 1.4331550802139037) internal successors, (268), 189 states have internal predecessors, (268), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-14 10:35:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 428 transitions. [2024-10-14 10:35:39,699 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 428 transitions. Word has length 158 [2024-10-14 10:35:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:35:39,699 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 428 transitions. [2024-10-14 10:35:39,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 15 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-14 10:35:39,700 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 428 transitions. [2024-10-14 10:35:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:35:39,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:35:39,701 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:35:39,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:35:39,701 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:35:39,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:35:39,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1056996317, now seen corresponding path program 1 times [2024-10-14 10:35:39,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:35:39,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654547221] [2024-10-14 10:35:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:35:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:35:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat