./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.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 fee106c2dd9d07a82140ad551bdb46665897289e1764fe2cd6376e02d0b80705 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:16:47,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:16:47,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:16:47,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:16:47,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:16:47,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:16:47,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:16:47,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:16:47,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:16:47,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:16:47,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:16:47,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:16:47,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:16:47,768 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:16:47,768 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:16:47,770 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:16:47,770 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:16:47,770 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:16:47,770 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:16:47,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:16:47,771 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:16:47,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:16:47,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:16:47,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:16:47,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:16:47,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:16:47,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:16:47,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:16:47,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:16:47,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:16:47,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:16:47,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:16:47,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:16:47,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:16:47,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:16:47,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:16:47,777 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 -> fee106c2dd9d07a82140ad551bdb46665897289e1764fe2cd6376e02d0b80705 [2024-11-08 22:16:48,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:16:48,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:16:48,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:16:48,072 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:16:48,072 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:16:48,073 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2024-11-08 22:16:49,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:16:49,535 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:16:49,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2024-11-08 22:16:49,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68ecd3c0/d0ca3dff13834d208d4f9a7c53fe580d/FLAG46e8657ac [2024-11-08 22:16:49,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a68ecd3c0/d0ca3dff13834d208d4f9a7c53fe580d [2024-11-08 22:16:49,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:16:49,572 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:16:49,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:16:49,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:16:49,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:16:49,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e46d148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49, skipping insertion in model container [2024-11-08 22:16:49,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,610 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:16:49,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i[919,932] [2024-11-08 22:16:49,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:16:49,826 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:16:49,836 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i[919,932] [2024-11-08 22:16:49,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:16:49,877 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:16:49,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49 WrapperNode [2024-11-08 22:16:49,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:16:49,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:16:49,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:16:49,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:16:49,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,951 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-08 22:16:49,952 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:16:49,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:16:49,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:16:49,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:16:49,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 22:16:49,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:49,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:50,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:50,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:16:50,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:16:50,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:16:50,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:16:50,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (1/1) ... [2024-11-08 22:16:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:16:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:16:50,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 22:16:50,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 22:16:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:16:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:16:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:16:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:16:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:16:50,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:16:50,223 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:16:50,225 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:16:50,563 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-08 22:16:50,563 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:16:50,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:16:50,577 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:16:50,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:16:50 BoogieIcfgContainer [2024-11-08 22:16:50,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:16:50,580 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:16:50,580 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:16:50,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:16:50,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:16:49" (1/3) ... [2024-11-08 22:16:50,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f87ba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:16:50, skipping insertion in model container [2024-11-08 22:16:50,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:16:49" (2/3) ... [2024-11-08 22:16:50,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f87ba0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:16:50, skipping insertion in model container [2024-11-08 22:16:50,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:16:50" (3/3) ... [2024-11-08 22:16:50,585 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-52.i [2024-11-08 22:16:50,599 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:16:50,599 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:16:50,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:16:50,657 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;@6f05b800, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:16:50,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:16:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 22:16:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 22:16:50,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:50,678 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:50,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:50,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash 439896638, now seen corresponding path program 1 times [2024-11-08 22:16:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:50,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83628339] [2024-11-08 22:16:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:50,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:51,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83628339] [2024-11-08 22:16:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83628339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:51,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:16:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886241324] [2024-11-08 22:16:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:51,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:16:51,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:51,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:16:51,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:16:51,056 INFO L87 Difference]: Start difference. First operand has 81 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 62 states have internal predecessors, (90), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 22:16:51,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:51,077 INFO L93 Difference]: Finished difference Result 155 states and 259 transitions. [2024-11-08 22:16:51,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:16:51,079 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 126 [2024-11-08 22:16:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:51,085 INFO L225 Difference]: With dead ends: 155 [2024-11-08 22:16:51,085 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 22:16:51,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:16:51,090 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:51,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:16:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 22:16:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-08 22:16:51,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 22:16:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-08 22:16:51,124 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 126 [2024-11-08 22:16:51,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:51,124 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-08 22:16:51,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 22:16:51,124 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-08 22:16:51,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 22:16:51,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:51,126 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:51,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:16:51,127 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:51,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:51,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2117552952, now seen corresponding path program 1 times [2024-11-08 22:16:51,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:51,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099993345] [2024-11-08 22:16:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:51,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:51,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:51,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:51,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099993345] [2024-11-08 22:16:51,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099993345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:51,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:51,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:16:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947711634] [2024-11-08 22:16:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:16:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:51,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:16:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:16:51,610 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:51,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:51,685 INFO L93 Difference]: Finished difference Result 206 states and 317 transitions. [2024-11-08 22:16:51,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:16:51,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 126 [2024-11-08 22:16:51,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:51,687 INFO L225 Difference]: With dead ends: 206 [2024-11-08 22:16:51,687 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 22:16:51,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-11-08 22:16:51,689 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 49 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:51,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 205 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:16:51,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 22:16:51,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-08 22:16:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 22:16:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2024-11-08 22:16:51,716 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 126 [2024-11-08 22:16:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:51,717 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2024-11-08 22:16:51,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:51,718 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2024-11-08 22:16:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 22:16:51,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:51,720 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:51,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:16:51,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:51,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1214733637, now seen corresponding path program 1 times [2024-11-08 22:16:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661525058] [2024-11-08 22:16:51,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:51,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:51,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:51,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661525058] [2024-11-08 22:16:52,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661525058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:52,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:16:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943514468] [2024-11-08 22:16:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:16:52,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:52,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:16:52,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:16:52,037 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:52,072 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2024-11-08 22:16:52,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:16:52,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 127 [2024-11-08 22:16:52,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:52,075 INFO L225 Difference]: With dead ends: 214 [2024-11-08 22:16:52,075 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 22:16:52,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-11-08 22:16:52,077 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:52,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 217 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:16:52,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 22:16:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 123. [2024-11-08 22:16:52,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 22:16:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 184 transitions. [2024-11-08 22:16:52,089 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 184 transitions. Word has length 127 [2024-11-08 22:16:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:52,090 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 184 transitions. [2024-11-08 22:16:52,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 184 transitions. [2024-11-08 22:16:52,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 22:16:52,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:52,092 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:52,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:16:52,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:52,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:52,093 INFO L85 PathProgramCache]: Analyzing trace with hash -278004800, now seen corresponding path program 1 times [2024-11-08 22:16:52,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:52,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394270074] [2024-11-08 22:16:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:52,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:52,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:52,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394270074] [2024-11-08 22:16:52,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394270074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:52,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:52,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:16:52,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624404447] [2024-11-08 22:16:52,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:52,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:16:52,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:52,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:16:52,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:16:52,288 INFO L87 Difference]: Start difference. First operand 123 states and 184 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:52,340 INFO L93 Difference]: Finished difference Result 271 states and 412 transitions. [2024-11-08 22:16:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:16:52,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 128 [2024-11-08 22:16:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:52,343 INFO L225 Difference]: With dead ends: 271 [2024-11-08 22:16:52,343 INFO L226 Difference]: Without dead ends: 197 [2024-11-08 22:16:52,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-11-08 22:16:52,345 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 74 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:52,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 214 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:16:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-08 22:16:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2024-11-08 22:16:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 140 states have (on average 1.3714285714285714) internal successors, (192), 140 states have internal predecessors, (192), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 22:16:52,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2024-11-08 22:16:52,365 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 128 [2024-11-08 22:16:52,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2024-11-08 22:16:52,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:52,366 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2024-11-08 22:16:52,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 22:16:52,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:52,367 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:52,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:16:52,368 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:52,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:52,368 INFO L85 PathProgramCache]: Analyzing trace with hash -290148771, now seen corresponding path program 1 times [2024-11-08 22:16:52,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:52,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650850182] [2024-11-08 22:16:52,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:52,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:53,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:53,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:53,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:53,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:53,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:53,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,343 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:53,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:53,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650850182] [2024-11-08 22:16:53,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650850182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:53,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:53,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:16:53,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498865007] [2024-11-08 22:16:53,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:53,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:16:53,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:53,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:16:53,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:16:53,346 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:53,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:53,439 INFO L93 Difference]: Finished difference Result 360 states and 546 transitions. [2024-11-08 22:16:53,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:16:53,439 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 130 [2024-11-08 22:16:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:53,441 INFO L225 Difference]: With dead ends: 360 [2024-11-08 22:16:53,442 INFO L226 Difference]: Without dead ends: 204 [2024-11-08 22:16:53,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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-11-08 22:16:53,445 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 49 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:53,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 195 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:16:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-08 22:16:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 195. [2024-11-08 22:16:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 140 states have (on average 1.3642857142857143) internal successors, (191), 140 states have internal predecessors, (191), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 22:16:53,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 293 transitions. [2024-11-08 22:16:53,469 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 293 transitions. Word has length 130 [2024-11-08 22:16:53,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:53,470 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 293 transitions. [2024-11-08 22:16:53,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:53,470 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 293 transitions. [2024-11-08 22:16:53,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 22:16:53,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:53,471 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:53,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:16:53,472 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:53,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:53,476 INFO L85 PathProgramCache]: Analyzing trace with hash 2063571354, now seen corresponding path program 1 times [2024-11-08 22:16:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822559682] [2024-11-08 22:16:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:53,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:53,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:53,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:53,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:53,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822559682] [2024-11-08 22:16:53,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822559682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:53,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:53,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:16:53,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684790142] [2024-11-08 22:16:53,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:53,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:16:53,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:53,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:16:53,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:16:53,712 INFO L87 Difference]: Start difference. First operand 195 states and 293 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:53,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:53,789 INFO L93 Difference]: Finished difference Result 494 states and 752 transitions. [2024-11-08 22:16:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:16:53,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-08 22:16:53,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:53,793 INFO L225 Difference]: With dead ends: 494 [2024-11-08 22:16:53,794 INFO L226 Difference]: Without dead ends: 341 [2024-11-08 22:16:53,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:16:53,795 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 80 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:53,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 374 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:16:53,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-08 22:16:53,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 337. [2024-11-08 22:16:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 246 states have (on average 1.3821138211382114) internal successors, (340), 246 states have internal predecessors, (340), 85 states have call successors, (85), 5 states have call predecessors, (85), 5 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-08 22:16:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 510 transitions. [2024-11-08 22:16:53,833 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 510 transitions. Word has length 132 [2024-11-08 22:16:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:53,833 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 510 transitions. [2024-11-08 22:16:53,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 510 transitions. [2024-11-08 22:16:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 22:16:53,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:53,834 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:53,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:16:53,835 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:53,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash -308167908, now seen corresponding path program 1 times [2024-11-08 22:16:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225008468] [2024-11-08 22:16:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:54,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:54,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225008468] [2024-11-08 22:16:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225008468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:54,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:54,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:16:54,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906349592] [2024-11-08 22:16:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:54,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:16:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:54,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:16:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:16:54,082 INFO L87 Difference]: Start difference. First operand 337 states and 510 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:54,188 INFO L93 Difference]: Finished difference Result 820 states and 1240 transitions. [2024-11-08 22:16:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:16:54,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-08 22:16:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:54,192 INFO L225 Difference]: With dead ends: 820 [2024-11-08 22:16:54,193 INFO L226 Difference]: Without dead ends: 532 [2024-11-08 22:16:54,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:16:54,195 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 80 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:54,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 318 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:16:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-08 22:16:54,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 524. [2024-11-08 22:16:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 396 states have (on average 1.378787878787879) internal successors, (546), 400 states have internal predecessors, (546), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:16:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 780 transitions. [2024-11-08 22:16:54,237 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 780 transitions. Word has length 132 [2024-11-08 22:16:54,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:54,238 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 780 transitions. [2024-11-08 22:16:54,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 780 transitions. [2024-11-08 22:16:54,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 22:16:54,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:54,239 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:54,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:16:54,240 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:54,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:54,240 INFO L85 PathProgramCache]: Analyzing trace with hash -50002470, now seen corresponding path program 1 times [2024-11-08 22:16:54,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:54,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934590264] [2024-11-08 22:16:54,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:54,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:16:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:16:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:16:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:16:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:16:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:16:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:16:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:16:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:16:54,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:16:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:16:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:16:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:16:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:16:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 22:16:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 22:16:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 22:16:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:16:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 22:16:54,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:16:54,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934590264] [2024-11-08 22:16:54,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934590264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:16:54,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:16:54,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:16:54,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071012021] [2024-11-08 22:16:54,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:16:54,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:16:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:16:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:16:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:16:54,500 INFO L87 Difference]: Start difference. First operand 524 states and 780 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:16:54,639 INFO L93 Difference]: Finished difference Result 998 states and 1492 transitions. [2024-11-08 22:16:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:16:54,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 132 [2024-11-08 22:16:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:16:54,642 INFO L225 Difference]: With dead ends: 998 [2024-11-08 22:16:54,642 INFO L226 Difference]: Without dead ends: 530 [2024-11-08 22:16:54,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:16:54,645 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 73 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:16:54,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 405 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:16:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-08 22:16:54,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 524. [2024-11-08 22:16:54,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 396 states have (on average 1.3686868686868687) internal successors, (542), 400 states have internal predecessors, (542), 117 states have call successors, (117), 10 states have call predecessors, (117), 10 states have return successors, (117), 113 states have call predecessors, (117), 117 states have call successors, (117) [2024-11-08 22:16:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 776 transitions. [2024-11-08 22:16:54,705 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 776 transitions. Word has length 132 [2024-11-08 22:16:54,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:16:54,705 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 776 transitions. [2024-11-08 22:16:54,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 22:16:54,705 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 776 transitions. [2024-11-08 22:16:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 22:16:54,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:16:54,706 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:16:54,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:16:54,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:16:54,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:16:54,707 INFO L85 PathProgramCache]: Analyzing trace with hash 108504821, now seen corresponding path program 1 times [2024-11-08 22:16:54,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:16:54,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900288112] [2024-11-08 22:16:54,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:16:54,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:16:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat