./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-14.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 501024b3e066273c508fa9d33fdd3109f2f1d06a81e6d6b9246168aeb9751ced --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 12:40:02,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 12:40:02,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 12:40:02,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 12:40:02,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 12:40:02,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 12:40:02,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 12:40:02,712 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 12:40:02,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 12:40:02,714 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 12:40:02,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 12:40:02,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 12:40:02,715 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 12:40:02,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 12:40:02,715 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 12:40:02,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 12:40:02,718 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 12:40:02,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 12:40:02,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 12:40:02,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 12:40:02,718 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 12:40:02,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 12:40:02,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 12:40:02,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 12:40:02,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 12:40:02,723 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 12:40:02,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 12:40:02,723 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 12:40:02,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 12:40:02,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 12:40:02,724 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 12:40:02,724 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 12:40:02,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:40:02,724 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 12:40:02,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 12:40:02,725 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 12:40:02,725 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 12:40:02,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 12:40:02,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 12:40:02,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 12:40:02,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 12:40:02,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 12:40:02,727 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 -> 501024b3e066273c508fa9d33fdd3109f2f1d06a81e6d6b9246168aeb9751ced [2024-10-14 12:40:02,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 12:40:02,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 12:40:02,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 12:40:02,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 12:40:02,987 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 12:40:02,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-14.i [2024-10-14 12:40:04,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 12:40:04,607 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 12:40:04,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-14.i [2024-10-14 12:40:04,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84e252ed/d61aaf5d88db491fb863ef1c51814b9f/FLAGad24a0887 [2024-10-14 12:40:05,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b84e252ed/d61aaf5d88db491fb863ef1c51814b9f [2024-10-14 12:40:05,003 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 12:40:05,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 12:40:05,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 12:40:05,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 12:40:05,012 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 12:40:05,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d85d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05, skipping insertion in model container [2024-10-14 12:40:05,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 12:40:05,163 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-14.i[915,928] [2024-10-14 12:40:05,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:40:05,211 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 12:40:05,220 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-14.i[915,928] [2024-10-14 12:40:05,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 12:40:05,253 INFO L204 MainTranslator]: Completed translation [2024-10-14 12:40:05,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05 WrapperNode [2024-10-14 12:40:05,254 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 12:40:05,255 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 12:40:05,255 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 12:40:05,255 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 12:40:05,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,286 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-10-14 12:40:05,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 12:40:05,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 12:40:05,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 12:40:05,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 12:40:05,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 12:40:05,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,314 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 12:40:05,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 12:40:05,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 12:40:05,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 12:40:05,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (1/1) ... [2024-10-14 12:40:05,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 12:40:05,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:40:05,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 12:40:05,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 12:40:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 12:40:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 12:40:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 12:40:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 12:40:05,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 12:40:05,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 12:40:05,457 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 12:40:05,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 12:40:05,665 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 12:40:05,665 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 12:40:05,703 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 12:40:05,703 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 12:40:05,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:40:05 BoogieIcfgContainer [2024-10-14 12:40:05,704 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 12:40:05,706 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 12:40:05,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 12:40:05,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 12:40:05,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 12:40:05" (1/3) ... [2024-10-14 12:40:05,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710f3354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:40:05, skipping insertion in model container [2024-10-14 12:40:05,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 12:40:05" (2/3) ... [2024-10-14 12:40:05,711 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710f3354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 12:40:05, skipping insertion in model container [2024-10-14 12:40:05,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 12:40:05" (3/3) ... [2024-10-14 12:40:05,713 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-14.i [2024-10-14 12:40:05,725 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 12:40:05,726 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 12:40:05,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 12:40:05,789 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;@94857c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 12:40:05,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 12:40:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:40:05,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 12:40:05,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:05,808 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:05,809 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:05,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:05,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1478719950, now seen corresponding path program 1 times [2024-10-14 12:40:05,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:05,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473698591] [2024-10-14 12:40:05,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:05,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:06,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:06,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,130 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:40:06,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:06,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473698591] [2024-10-14 12:40:06,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473698591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:40:06,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:40:06,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 12:40:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785468429] [2024-10-14 12:40:06,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:40:06,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 12:40:06,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:40:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 12:40:06,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:40:06,165 INFO L87 Difference]: Start difference. First operand has 44 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:40:06,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:40:06,208 INFO L93 Difference]: Finished difference Result 85 states and 148 transitions. [2024-10-14 12:40:06,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 12:40:06,211 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 99 [2024-10-14 12:40:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:40:06,219 INFO L225 Difference]: With dead ends: 85 [2024-10-14 12:40:06,220 INFO L226 Difference]: Without dead ends: 42 [2024-10-14 12:40:06,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 12:40:06,227 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 12:40:06,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 12:40:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-14 12:40:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-14 12:40:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-14 12:40:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2024-10-14 12:40:06,263 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 99 [2024-10-14 12:40:06,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:40:06,264 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2024-10-14 12:40:06,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:40:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2024-10-14 12:40:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 12:40:06,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:06,268 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:06,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 12:40:06,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:06,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:06,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1744004658, now seen corresponding path program 1 times [2024-10-14 12:40:06,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:06,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608979994] [2024-10-14 12:40:06,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:06,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:06,722 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:40:06,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:06,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608979994] [2024-10-14 12:40:06,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608979994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:40:06,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:40:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 12:40:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372590988] [2024-10-14 12:40:06,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:40:06,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 12:40:06,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:40:06,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 12:40:06,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 12:40:06,729 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:40:06,870 INFO L93 Difference]: Finished difference Result 135 states and 198 transitions. [2024-10-14 12:40:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:40:06,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-14 12:40:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:40:06,874 INFO L225 Difference]: With dead ends: 135 [2024-10-14 12:40:06,874 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 12:40:06,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:40:06,878 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:40:06,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 167 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:40:06,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 12:40:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-10-14 12:40:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 12:40:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2024-10-14 12:40:06,904 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 99 [2024-10-14 12:40:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:40:06,906 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2024-10-14 12:40:06,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2024-10-14 12:40:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 12:40:06,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:06,909 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:06,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 12:40:06,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:06,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:06,910 INFO L85 PathProgramCache]: Analyzing trace with hash 934658032, now seen corresponding path program 1 times [2024-10-14 12:40:06,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:06,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982069113] [2024-10-14 12:40:06,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:06,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:09,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:09,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:40:09,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:09,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982069113] [2024-10-14 12:40:09,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982069113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:40:09,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:40:09,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 12:40:09,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512843423] [2024-10-14 12:40:09,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:40:09,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 12:40:09,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:40:09,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 12:40:09,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 12:40:09,871 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:10,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:40:10,334 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2024-10-14 12:40:10,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 12:40:10,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-14 12:40:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:40:10,336 INFO L225 Difference]: With dead ends: 91 [2024-10-14 12:40:10,336 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 12:40:10,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:40:10,337 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 74 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 12:40:10,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 167 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 12:40:10,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 12:40:10,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2024-10-14 12:40:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 12:40:10,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 123 transitions. [2024-10-14 12:40:10,349 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 123 transitions. Word has length 99 [2024-10-14 12:40:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:40:10,350 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 123 transitions. [2024-10-14 12:40:10,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 123 transitions. [2024-10-14 12:40:10,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 12:40:10,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:10,353 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:10,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 12:40:10,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash 934717614, now seen corresponding path program 1 times [2024-10-14 12:40:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886481781] [2024-10-14 12:40:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:40:10,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:10,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886481781] [2024-10-14 12:40:10,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886481781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:40:10,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:40:10,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 12:40:10,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187978384] [2024-10-14 12:40:10,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:40:10,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 12:40:10,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:40:10,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 12:40:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 12:40:10,515 INFO L87 Difference]: Start difference. First operand 84 states and 123 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:10,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:40:10,638 INFO L93 Difference]: Finished difference Result 206 states and 303 transitions. [2024-10-14 12:40:10,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 12:40:10,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2024-10-14 12:40:10,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:40:10,640 INFO L225 Difference]: With dead ends: 206 [2024-10-14 12:40:10,640 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 12:40:10,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 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-10-14 12:40:10,644 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 41 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 12:40:10,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 190 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 12:40:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 12:40:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2024-10-14 12:40:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 69 states have internal predecessors, (82), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-14 12:40:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 178 transitions. [2024-10-14 12:40:10,661 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 178 transitions. Word has length 99 [2024-10-14 12:40:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:40:10,661 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 178 transitions. [2024-10-14 12:40:10,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:10,662 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 178 transitions. [2024-10-14 12:40:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 12:40:10,663 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:10,663 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:10,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 12:40:10,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:10,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:10,663 INFO L85 PathProgramCache]: Analyzing trace with hash -506303846, now seen corresponding path program 1 times [2024-10-14 12:40:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757780022] [2024-10-14 12:40:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:13,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:13,965 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:40:13,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:13,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757780022] [2024-10-14 12:40:13,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757780022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:40:13,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:40:13,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 12:40:13,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110178179] [2024-10-14 12:40:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:40:13,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 12:40:13,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:40:13,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 12:40:13,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 12:40:13,967 INFO L87 Difference]: Start difference. First operand 121 states and 178 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:40:15,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:40:15,082 INFO L93 Difference]: Finished difference Result 193 states and 261 transitions. [2024-10-14 12:40:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 12:40:15,083 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-10-14 12:40:15,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:40:15,086 INFO L225 Difference]: With dead ends: 193 [2024-10-14 12:40:15,086 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 12:40:15,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2024-10-14 12:40:15,089 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 174 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 12:40:15,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 295 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 12:40:15,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 12:40:15,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 148. [2024-10-14 12:40:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 89 states have (on average 1.202247191011236) internal successors, (107), 90 states have internal predecessors, (107), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 12:40:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 215 transitions. [2024-10-14 12:40:15,123 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 215 transitions. Word has length 100 [2024-10-14 12:40:15,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:40:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 215 transitions. [2024-10-14 12:40:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 12 states have internal predecessors, (23), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 12:40:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 215 transitions. [2024-10-14 12:40:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 12:40:15,125 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:15,125 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:15,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 12:40:15,125 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:15,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:15,126 INFO L85 PathProgramCache]: Analyzing trace with hash -563562148, now seen corresponding path program 1 times [2024-10-14 12:40:15,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:15,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038996935] [2024-10-14 12:40:15,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:15,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:17,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-14 12:40:17,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:17,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038996935] [2024-10-14 12:40:17,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038996935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 12:40:17,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 12:40:17,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 12:40:17,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664563101] [2024-10-14 12:40:17,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 12:40:17,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 12:40:17,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 12:40:17,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 12:40:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 12:40:17,312 INFO L87 Difference]: Start difference. First operand 148 states and 215 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 12:40:17,913 INFO L93 Difference]: Finished difference Result 186 states and 260 transitions. [2024-10-14 12:40:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 12:40:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2024-10-14 12:40:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 12:40:17,918 INFO L225 Difference]: With dead ends: 186 [2024-10-14 12:40:17,918 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 12:40:17,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-10-14 12:40:17,920 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 39 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 12:40:17,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 318 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 12:40:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 12:40:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 158. [2024-10-14 12:40:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 100 states have internal predecessors, (121), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-14 12:40:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-10-14 12:40:17,949 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 100 [2024-10-14 12:40:17,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 12:40:17,949 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-10-14 12:40:17,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-10-14 12:40:17,950 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-10-14 12:40:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-14 12:40:17,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 12:40:17,951 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 12:40:17,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 12:40:17,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 12:40:17,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 12:40:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1205134467, now seen corresponding path program 1 times [2024-10-14 12:40:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 12:40:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414306799] [2024-10-14 12:40:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:17,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 12:40:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 12:40:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 12:40:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 12:40:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 12:40:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 12:40:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 12:40:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 12:40:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 12:40:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 12:40:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 12:40:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 12:40:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 12:40:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 12:40:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 12:40:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 12:40:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 12:40:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 12:40:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-14 12:40:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 12:40:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-14 12:40:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 12:40:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-14 12:40:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-14 12:40:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-14 12:40:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-14 12:40:18,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-14 12:40:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-14 12:40:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-14 12:40:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 12:40:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-14 12:40:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-14 12:40:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-14 12:40:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 12:40:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 12:40:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414306799] [2024-10-14 12:40:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414306799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 12:40:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175108621] [2024-10-14 12:40:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 12:40:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 12:40:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 12:40:18,416 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 12:40:18,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 12:40:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 12:40:18,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-14 12:40:18,541 INFO L278 TraceCheckSpWp]: Computing forward predicates...