./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.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 f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:08:20,998 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:08:21,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:08:21,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:08:21,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:08:21,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:08:21,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:08:21,095 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:08:21,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:08:21,096 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:08:21,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:08:21,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:08:21,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:08:21,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:08:21,098 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:08:21,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:08:21,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:08:21,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:08:21,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:08:21,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:08:21,100 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:08:21,105 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:08:21,105 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:08:21,106 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:08:21,106 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:08:21,106 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:08:21,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:08:21,107 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:08:21,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:08:21,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:08:21,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:08:21,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:08:21,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:08:21,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:08:21,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:08:21,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:08:21,112 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:08:21,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:08:21,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:08:21,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:08:21,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:08:21,114 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:08:21,115 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 -> f6ff634e5a2ddc2f99bfdcb8104b17cc6d633ac176eb1b09b8fd9ed3cc24553b [2024-11-09 00:08:21,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:08:21,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:08:21,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:08:21,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:08:21,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:08:21,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-11-09 00:08:23,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:08:23,601 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:08:23,601 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-11-09 00:08:23,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac42a6d83/11c045107e5142d086188305cde86184/FLAGb8e100679 [2024-11-09 00:08:23,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac42a6d83/11c045107e5142d086188305cde86184 [2024-11-09 00:08:23,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:08:23,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:08:23,644 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:08:23,644 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:08:23,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:08:23,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:23,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738bc31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23, skipping insertion in model container [2024-11-09 00:08:23,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:23,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:08:23,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i[915,928] [2024-11-09 00:08:23,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:08:23,919 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:08:23,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-86.i[915,928] [2024-11-09 00:08:23,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:08:23,998 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:08:23,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23 WrapperNode [2024-11-09 00:08:23,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:08:24,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:08:24,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:08:24,001 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:08:24,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,061 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-11-09 00:08:24,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:08:24,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:08:24,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:08:24,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:08:24,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,111 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 00:08:24,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,127 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,152 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:08:24,153 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:08:24,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:08:24,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:08:24,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (1/1) ... [2024-11-09 00:08:24,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:08:24,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:08:24,206 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:08:24,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:08:24,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:08:24,261 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:08:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:08:24,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:08:24,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:08:24,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:08:24,341 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:08:24,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:08:24,772 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-09 00:08:24,772 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:08:24,789 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:08:24,790 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:08:24,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:08:24 BoogieIcfgContainer [2024-11-09 00:08:24,790 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:08:24,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:08:24,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:08:24,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:08:24,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:08:23" (1/3) ... [2024-11-09 00:08:24,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b881e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:08:24, skipping insertion in model container [2024-11-09 00:08:24,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:08:23" (2/3) ... [2024-11-09 00:08:24,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b881e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:08:24, skipping insertion in model container [2024-11-09 00:08:24,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:08:24" (3/3) ... [2024-11-09 00:08:24,801 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-86.i [2024-11-09 00:08:24,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:08:24,821 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:08:24,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:08:24,897 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;@4c384c78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:08:24,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:08:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 00:08:24,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:08:24,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:24,914 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:24,915 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1487805863, now seen corresponding path program 1 times [2024-11-09 00:08:24,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:24,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359412080] [2024-11-09 00:08:24,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:24,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:25,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:25,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:25,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:25,490 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:25,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359412080] [2024-11-09 00:08:25,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359412080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:08:25,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848159826] [2024-11-09 00:08:25,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:25,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:08:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:08:25,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:08:25,532 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 00:08:25,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:25,557 INFO L93 Difference]: Finished difference Result 109 states and 178 transitions. [2024-11-09 00:08:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:08:25,561 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2024-11-09 00:08:25,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:25,573 INFO L225 Difference]: With dead ends: 109 [2024-11-09 00:08:25,574 INFO L226 Difference]: Without dead ends: 52 [2024-11-09 00:08:25,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:08:25,585 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:25,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:08:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-09 00:08:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-09 00:08:25,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 00:08:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2024-11-09 00:08:25,638 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 101 [2024-11-09 00:08:25,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:25,639 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 76 transitions. [2024-11-09 00:08:25,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 00:08:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 76 transitions. [2024-11-09 00:08:25,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:08:25,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:25,644 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:25,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:08:25,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:25,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:25,646 INFO L85 PathProgramCache]: Analyzing trace with hash 329626985, now seen corresponding path program 1 times [2024-11-09 00:08:25,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:25,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087768312] [2024-11-09 00:08:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:26,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:26,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087768312] [2024-11-09 00:08:26,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087768312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:26,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:26,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:08:26,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462539960] [2024-11-09 00:08:26,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:26,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:08:26,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:08:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:08:26,328 INFO L87 Difference]: Start difference. First operand 52 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:26,657 INFO L93 Difference]: Finished difference Result 151 states and 223 transitions. [2024-11-09 00:08:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:08:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-09 00:08:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:26,665 INFO L225 Difference]: With dead ends: 151 [2024-11-09 00:08:26,666 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 00:08:26,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:08:26,668 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 68 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:26,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 244 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:08:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 00:08:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 81. [2024-11-09 00:08:26,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:08:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-09 00:08:26,700 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 101 [2024-11-09 00:08:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:26,701 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-09 00:08:26,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-09 00:08:26,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:08:26,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:26,703 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:26,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:08:26,704 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:26,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:26,704 INFO L85 PathProgramCache]: Analyzing trace with hash -681490265, now seen corresponding path program 1 times [2024-11-09 00:08:26,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:26,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301210882] [2024-11-09 00:08:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:26,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:32,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:32,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:32,349 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:32,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:32,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301210882] [2024-11-09 00:08:32,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301210882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:32,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:32,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 00:08:32,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221878822] [2024-11-09 00:08:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:32,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 00:08:32,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:32,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 00:08:32,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-09 00:08:32,353 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:33,824 INFO L93 Difference]: Finished difference Result 211 states and 303 transitions. [2024-11-09 00:08:33,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 00:08:33,825 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-09 00:08:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:33,831 INFO L225 Difference]: With dead ends: 211 [2024-11-09 00:08:33,831 INFO L226 Difference]: Without dead ends: 162 [2024-11-09 00:08:33,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2024-11-09 00:08:33,834 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 247 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:33,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 525 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:08:33,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-09 00:08:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 98. [2024-11-09 00:08:33,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-09 00:08:33,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2024-11-09 00:08:33,863 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 101 [2024-11-09 00:08:33,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:33,864 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2024-11-09 00:08:33,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:33,864 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2024-11-09 00:08:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 00:08:33,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:33,866 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:33,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:08:33,867 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:33,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 19574313, now seen corresponding path program 1 times [2024-11-09 00:08:33,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:33,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967730337] [2024-11-09 00:08:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:33,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:33,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:33,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:33,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:34,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:34,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:34,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967730337] [2024-11-09 00:08:34,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967730337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:34,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:34,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:08:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737747959] [2024-11-09 00:08:34,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:34,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:08:34,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:08:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:08:34,016 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:34,069 INFO L93 Difference]: Finished difference Result 195 states and 286 transitions. [2024-11-09 00:08:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:08:34,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-09 00:08:34,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:34,075 INFO L225 Difference]: With dead ends: 195 [2024-11-09 00:08:34,075 INFO L226 Difference]: Without dead ends: 146 [2024-11-09 00:08:34,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:08:34,081 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:34,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 153 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:08:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-09 00:08:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2024-11-09 00:08:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:08:34,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-11-09 00:08:34,116 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 101 [2024-11-09 00:08:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-11-09 00:08:34,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:34,118 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-11-09 00:08:34,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:08:34,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:34,119 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:34,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:08:34,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:34,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 189982648, now seen corresponding path program 1 times [2024-11-09 00:08:34,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:34,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483516953] [2024-11-09 00:08:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:34,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483516953] [2024-11-09 00:08:34,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483516953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:34,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:34,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:08:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419942390] [2024-11-09 00:08:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:34,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:08:34,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:34,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:08:34,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:08:34,352 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:34,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:34,385 INFO L93 Difference]: Finished difference Result 251 states and 365 transitions. [2024-11-09 00:08:34,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 00:08:34,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-09 00:08:34,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:34,389 INFO L225 Difference]: With dead ends: 251 [2024-11-09 00:08:34,389 INFO L226 Difference]: Without dead ends: 153 [2024-11-09 00:08:34,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:08:34,394 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 6 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:34,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:08:34,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-09 00:08:34,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2024-11-09 00:08:34,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2210526315789474) internal successors, (116), 95 states have internal predecessors, (116), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:08:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 206 transitions. [2024-11-09 00:08:34,428 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 206 transitions. Word has length 102 [2024-11-09 00:08:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 206 transitions. [2024-11-09 00:08:34,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 206 transitions. [2024-11-09 00:08:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:08:34,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:34,435 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:08:34,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:34,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:34,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1964990010, now seen corresponding path program 1 times [2024-11-09 00:08:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340625917] [2024-11-09 00:08:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:34,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:38,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:38,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:38,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:38,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:38,453 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:38,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:38,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340625917] [2024-11-09 00:08:38,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340625917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:38,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:38,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:08:38,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675486097] [2024-11-09 00:08:38,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:38,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:08:38,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:38,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:08:38,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:08:38,461 INFO L87 Difference]: Start difference. First operand 144 states and 206 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:39,638 INFO L93 Difference]: Finished difference Result 204 states and 272 transitions. [2024-11-09 00:08:39,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:08:39,639 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-09 00:08:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:39,641 INFO L225 Difference]: With dead ends: 204 [2024-11-09 00:08:39,643 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 00:08:39,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2024-11-09 00:08:39,645 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 278 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:39,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 446 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 00:08:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 00:08:39,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 142. [2024-11-09 00:08:39,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.2150537634408602) internal successors, (113), 93 states have internal predecessors, (113), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:08:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 203 transitions. [2024-11-09 00:08:39,677 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 203 transitions. Word has length 102 [2024-11-09 00:08:39,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:39,677 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 203 transitions. [2024-11-09 00:08:39,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:39,677 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 203 transitions. [2024-11-09 00:08:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:08:39,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:39,679 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:39,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 00:08:39,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash 402140062, now seen corresponding path program 1 times [2024-11-09 00:08:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866808551] [2024-11-09 00:08:39,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:39,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:45,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:45,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866808551] [2024-11-09 00:08:45,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866808551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:45,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:45,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:08:45,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038368221] [2024-11-09 00:08:45,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:45,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:08:45,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:45,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:08:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:08:45,744 INFO L87 Difference]: Start difference. First operand 142 states and 203 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:08:48,915 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2024-11-09 00:08:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 00:08:48,918 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-09 00:08:48,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:08:48,920 INFO L225 Difference]: With dead ends: 202 [2024-11-09 00:08:48,920 INFO L226 Difference]: Without dead ends: 200 [2024-11-09 00:08:48,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2024-11-09 00:08:48,927 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 318 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:08:48,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 407 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 00:08:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-09 00:08:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 145. [2024-11-09 00:08:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:08:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 207 transitions. [2024-11-09 00:08:48,955 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 207 transitions. Word has length 102 [2024-11-09 00:08:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:08:48,957 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 207 transitions. [2024-11-09 00:08:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:08:48,958 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 207 transitions. [2024-11-09 00:08:48,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:08:48,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:08:48,959 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:08:48,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:08:48,960 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:08:48,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:08:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1520867287, now seen corresponding path program 1 times [2024-11-09 00:08:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:08:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101389007] [2024-11-09 00:08:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:08:48,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:08:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:08:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:08:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:08:56,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:08:56,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:08:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:08:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:08:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:08:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:08:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:08:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:08:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:08:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:08:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:08:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:08:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:08:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:08:56,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:08:56,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101389007] [2024-11-09 00:08:56,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101389007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:08:56,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:08:56,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 00:08:56,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046048969] [2024-11-09 00:08:56,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:08:56,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 00:08:56,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:08:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 00:08:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:08:56,371 INFO L87 Difference]: Start difference. First operand 145 states and 207 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:09:02,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:02,604 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-09 00:09:02,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 00:09:02,606 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-09 00:09:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:02,608 INFO L225 Difference]: With dead ends: 221 [2024-11-09 00:09:02,608 INFO L226 Difference]: Without dead ends: 219 [2024-11-09 00:09:02,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2024-11-09 00:09:02,609 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 262 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:09:02,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 438 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 00:09:02,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-09 00:09:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 155. [2024-11-09 00:09:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:09:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2024-11-09 00:09:02,643 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 102 [2024-11-09 00:09:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:02,644 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2024-11-09 00:09:02,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 15 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:09:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2024-11-09 00:09:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 00:09:02,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:02,645 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:09:02,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:09:02,645 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:02,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:02,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2094041639, now seen corresponding path program 1 times [2024-11-09 00:09:02,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:02,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218439329] [2024-11-09 00:09:02,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:02,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:09:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:09:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:09:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:09:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:09:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:09:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:09:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:09:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:09:10,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:09:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:09:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:09:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:09:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:09:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:09:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:09:10,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:09:10,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218439329] [2024-11-09 00:09:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218439329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:10,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:10,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 00:09:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324397292] [2024-11-09 00:09:10,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:10,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 00:09:10,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:09:10,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 00:09:10,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-09 00:09:10,626 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:09:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:18,237 INFO L93 Difference]: Finished difference Result 214 states and 285 transitions. [2024-11-09 00:09:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 00:09:18,238 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-09 00:09:18,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:18,240 INFO L225 Difference]: With dead ends: 214 [2024-11-09 00:09:18,240 INFO L226 Difference]: Without dead ends: 212 [2024-11-09 00:09:18,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=281, Invalid=711, Unknown=0, NotChecked=0, Total=992 [2024-11-09 00:09:18,246 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 178 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:09:18,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 494 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 00:09:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-09 00:09:18,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 155. [2024-11-09 00:09:18,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:09:18,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 220 transitions. [2024-11-09 00:09:18,261 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 220 transitions. Word has length 102 [2024-11-09 00:09:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:18,261 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 220 transitions. [2024-11-09 00:09:18,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:09:18,262 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 220 transitions. [2024-11-09 00:09:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:09:18,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:18,263 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:09:18,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:09:18,264 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:18,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:18,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1420763835, now seen corresponding path program 1 times [2024-11-09 00:09:18,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:18,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510483572] [2024-11-09 00:09:18,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:18,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:09:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:09:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:09:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:09:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:09:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:09:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:09:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:09:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:09:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:09:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 00:09:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:09:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:09:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:09:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:09:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:09:30,724 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-09 00:09:30,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:09:30,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510483572] [2024-11-09 00:09:30,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510483572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:09:30,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:09:30,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 00:09:30,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866888507] [2024-11-09 00:09:30,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:09:30,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 00:09:30,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:09:30,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 00:09:30,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-09 00:09:30,727 INFO L87 Difference]: Start difference. First operand 155 states and 220 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:09:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:09:38,218 INFO L93 Difference]: Finished difference Result 224 states and 297 transitions. [2024-11-09 00:09:38,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 00:09:38,219 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-09 00:09:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:09:38,221 INFO L225 Difference]: With dead ends: 224 [2024-11-09 00:09:38,221 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 00:09:38,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=344, Invalid=916, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 00:09:38,223 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 214 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-09 00:09:38,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 471 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-09 00:09:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 00:09:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 159. [2024-11-09 00:09:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 110 states have internal predecessors, (135), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 00:09:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 225 transitions. [2024-11-09 00:09:38,236 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 225 transitions. Word has length 103 [2024-11-09 00:09:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:09:38,236 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 225 transitions. [2024-11-09 00:09:38,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-09 00:09:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 225 transitions. [2024-11-09 00:09:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 00:09:38,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:09:38,237 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:09:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 00:09:38,238 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:09:38,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:09:38,238 INFO L85 PathProgramCache]: Analyzing trace with hash 2100822205, now seen corresponding path program 1 times [2024-11-09 00:09:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:09:38,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427565635] [2024-11-09 00:09:38,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:09:38,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:09:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat