./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:04:58,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:04:58,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 20:04:58,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:04:58,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:04:58,515 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:04:58,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:04:58,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:04:58,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:04:58,520 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:04:58,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:04:58,521 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:04:58,522 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:04:58,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:04:58,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:04:58,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:04:58,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:04:58,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:04:58,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 20:04:58,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:04:58,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:04:58,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:04:58,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:04:58,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:04:58,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:04:58,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:04:58,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:04:58,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:04:58,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:04:58,529 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:04:58,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:04:58,529 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:04:58,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:04:58,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:04:58,530 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:04:58,530 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:04:58,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 20:04:58,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 20:04:58,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:04:58,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:04:58,536 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:04:58,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:04:58,537 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2024-11-08 20:04:58,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:04:58,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:04:58,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:04:58,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:04:58,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:04:58,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-08 20:05:00,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:05:00,608 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:05:00,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-08 20:05:00,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f818494/c44b4207664c43749f8e2680a5d2e0fb/FLAG88a690818 [2024-11-08 20:05:00,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f818494/c44b4207664c43749f8e2680a5d2e0fb [2024-11-08 20:05:00,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:05:00,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:05:00,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:05:00,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:05:00,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:05:00,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:05:00" (1/1) ... [2024-11-08 20:05:00,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74952bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:00, skipping insertion in model container [2024-11-08 20:05:00,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:05:00" (1/1) ... [2024-11-08 20:05:00,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:05:00,915 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-11-08 20:05:01,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:05:01,030 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:05:01,041 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-11-08 20:05:01,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:05:01,105 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:05:01,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01 WrapperNode [2024-11-08 20:05:01,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:05:01,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:05:01,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:05:01,108 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:05:01,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,165 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-11-08 20:05:01,166 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:05:01,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:05:01,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:05:01,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:05:01,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,183 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,203 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:05:01,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,219 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,233 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:05:01,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:05:01,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:05:01,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:05:01,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (1/1) ... [2024-11-08 20:05:01,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:05:01,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:05:01,294 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:05:01,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:05:01,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:05:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:05:01,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:05:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 20:05:01,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:05:01,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:05:01,488 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:05:01,490 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:05:02,095 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 20:05:02,095 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:05:02,115 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:05:02,116 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:05:02,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:05:02 BoogieIcfgContainer [2024-11-08 20:05:02,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:05:02,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:05:02,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:05:02,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:05:02,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:05:00" (1/3) ... [2024-11-08 20:05:02,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bae143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:05:02, skipping insertion in model container [2024-11-08 20:05:02,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:01" (2/3) ... [2024-11-08 20:05:02,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58bae143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:05:02, skipping insertion in model container [2024-11-08 20:05:02,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:05:02" (3/3) ... [2024-11-08 20:05:02,128 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-08 20:05:02,146 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:05:02,147 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:05:02,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:05:02,238 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;@5f325637, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:05:02,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:05:02,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 92 states have internal predecessors, (140), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:05:02,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-08 20:05:02,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:02,264 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:02,264 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:02,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash -444858248, now seen corresponding path program 1 times [2024-11-08 20:05:02,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:02,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178670411] [2024-11-08 20:05:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:02,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:03,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:03,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:03,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:03,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:03,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:03,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:03,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:03,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178670411] [2024-11-08 20:05:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178670411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:03,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:05:03,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576291544] [2024-11-08 20:05:03,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:03,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:05:03,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:03,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:05:03,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:03,347 INFO L87 Difference]: Start difference. First operand has 133 states, 91 states have (on average 1.5384615384615385) internal successors, (140), 92 states have internal predecessors, (140), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:03,462 INFO L93 Difference]: Finished difference Result 326 states and 616 transitions. [2024-11-08 20:05:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:05:03,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 250 [2024-11-08 20:05:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:03,483 INFO L225 Difference]: With dead ends: 326 [2024-11-08 20:05:03,483 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 20:05:03,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:03,491 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 200 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:03,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 408 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:05:03,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 20:05:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2024-11-08 20:05:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 88 states have (on average 1.4772727272727273) internal successors, (130), 88 states have internal predecessors, (130), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:05:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 208 transitions. [2024-11-08 20:05:03,586 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 208 transitions. Word has length 250 [2024-11-08 20:05:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:03,589 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 208 transitions. [2024-11-08 20:05:03,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 208 transitions. [2024-11-08 20:05:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-08 20:05:03,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:03,596 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:03,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 20:05:03,597 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:03,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:03,598 INFO L85 PathProgramCache]: Analyzing trace with hash -659469682, now seen corresponding path program 1 times [2024-11-08 20:05:03,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446193130] [2024-11-08 20:05:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:03,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:04,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:04,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:04,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:04,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:04,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:04,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:04,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:04,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:04,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446193130] [2024-11-08 20:05:04,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446193130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:04,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:04,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:05:04,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689126601] [2024-11-08 20:05:04,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:04,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:05:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:04,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:05:04,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:04,208 INFO L87 Difference]: Start difference. First operand 129 states and 208 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:04,511 INFO L93 Difference]: Finished difference Result 351 states and 567 transitions. [2024-11-08 20:05:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:05:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 251 [2024-11-08 20:05:04,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:04,516 INFO L225 Difference]: With dead ends: 351 [2024-11-08 20:05:04,516 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 20:05:04,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:04,518 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 288 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:04,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 659 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:05:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 20:05:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2024-11-08 20:05:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 107 states have (on average 1.4953271028037383) internal successors, (160), 107 states have internal predecessors, (160), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:05:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions. [2024-11-08 20:05:04,550 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 251 [2024-11-08 20:05:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:04,552 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 238 transitions. [2024-11-08 20:05:04,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions. [2024-11-08 20:05:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:04,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:04,560 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:04,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 20:05:04,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:04,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:04,561 INFO L85 PathProgramCache]: Analyzing trace with hash 713954525, now seen corresponding path program 1 times [2024-11-08 20:05:04,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:04,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708951625] [2024-11-08 20:05:04,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:04,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:04,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:04,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:04,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:04,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:04,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708951625] [2024-11-08 20:05:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708951625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:05:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715590548] [2024-11-08 20:05:04,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:04,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:05:04,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:04,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:05:04,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:04,912 INFO L87 Difference]: Start difference. First operand 149 states and 238 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:04,937 INFO L93 Difference]: Finished difference Result 296 states and 475 transitions. [2024-11-08 20:05:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:05:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:04,942 INFO L225 Difference]: With dead ends: 296 [2024-11-08 20:05:04,942 INFO L226 Difference]: Without dead ends: 150 [2024-11-08 20:05:04,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:04,946 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:04,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:05:04,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-08 20:05:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-08 20:05:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 39 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:05:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions. [2024-11-08 20:05:04,975 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 252 [2024-11-08 20:05:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 239 transitions. [2024-11-08 20:05:04,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:04,976 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions. [2024-11-08 20:05:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:04,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:04,980 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:04,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 20:05:04,980 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:04,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:04,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1280190181, now seen corresponding path program 1 times [2024-11-08 20:05:04,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:04,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858035057] [2024-11-08 20:05:04,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:05,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:05,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858035057] [2024-11-08 20:05:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858035057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:05,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:05:05,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493409906] [2024-11-08 20:05:05,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:05,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:05:05,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:05:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:05,251 INFO L87 Difference]: Start difference. First operand 150 states and 239 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:05,300 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2024-11-08 20:05:05,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:05:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:05,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:05,306 INFO L225 Difference]: With dead ends: 408 [2024-11-08 20:05:05,306 INFO L226 Difference]: Without dead ends: 261 [2024-11-08 20:05:05,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:05,312 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 138 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 500 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-08 20:05:05,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 500 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:05:05,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-08 20:05:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2024-11-08 20:05:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 192 states have (on average 1.5) internal successors, (288), 193 states have internal predecessors, (288), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-08 20:05:05,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 410 transitions. [2024-11-08 20:05:05,353 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 410 transitions. Word has length 252 [2024-11-08 20:05:05,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:05,354 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 410 transitions. [2024-11-08 20:05:05,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:05,355 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 410 transitions. [2024-11-08 20:05:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:05,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:05,359 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:05,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 20:05:05,360 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:05,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:05,360 INFO L85 PathProgramCache]: Analyzing trace with hash 643037853, now seen corresponding path program 1 times [2024-11-08 20:05:05,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:05,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681024039] [2024-11-08 20:05:05,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:05,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:05,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:05,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:05,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:05,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681024039] [2024-11-08 20:05:05,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681024039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:05,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:05,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:05:05,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098290195] [2024-11-08 20:05:05,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:05,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:05:05,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:05,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:05:05,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:05:05,776 INFO L87 Difference]: Start difference. First operand 258 states and 410 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:06,043 INFO L93 Difference]: Finished difference Result 671 states and 1071 transitions. [2024-11-08 20:05:06,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:05:06,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:06,049 INFO L225 Difference]: With dead ends: 671 [2024-11-08 20:05:06,049 INFO L226 Difference]: Without dead ends: 416 [2024-11-08 20:05:06,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:05:06,051 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 335 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:06,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 635 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:05:06,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-08 20:05:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 260. [2024-11-08 20:05:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 194 states have (on average 1.5051546391752577) internal successors, (292), 195 states have internal predecessors, (292), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-08 20:05:06,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions. [2024-11-08 20:05:06,079 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252 [2024-11-08 20:05:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:06,081 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 414 transitions. [2024-11-08 20:05:06,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:06,081 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions. [2024-11-08 20:05:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:06,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:06,085 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:06,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 20:05:06,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:06,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:06,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1162400481, now seen corresponding path program 1 times [2024-11-08 20:05:06,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:06,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067673030] [2024-11-08 20:05:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:06,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:06,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:06,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:06,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:06,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:06,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067673030] [2024-11-08 20:05:06,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067673030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:06,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:06,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:05:06,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933197967] [2024-11-08 20:05:06,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:06,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:05:06,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:05:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:05:06,675 INFO L87 Difference]: Start difference. First operand 260 states and 414 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:07,019 INFO L93 Difference]: Finished difference Result 723 states and 1151 transitions. [2024-11-08 20:05:07,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:05:07,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:07,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:07,024 INFO L225 Difference]: With dead ends: 723 [2024-11-08 20:05:07,024 INFO L226 Difference]: Without dead ends: 466 [2024-11-08 20:05:07,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:05:07,026 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 607 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:07,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 500 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:05:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-08 20:05:07,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 260. [2024-11-08 20:05:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 194 states have (on average 1.5051546391752577) internal successors, (292), 195 states have internal predecessors, (292), 61 states have call successors, (61), 4 states have call predecessors, (61), 4 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-08 20:05:07,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions. [2024-11-08 20:05:07,074 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252 [2024-11-08 20:05:07,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:07,075 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 414 transitions. [2024-11-08 20:05:07,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:07,075 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions. [2024-11-08 20:05:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:07,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:07,081 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:07,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 20:05:07,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:07,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:07,083 INFO L85 PathProgramCache]: Analyzing trace with hash -703347101, now seen corresponding path program 1 times [2024-11-08 20:05:07,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:07,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803703886] [2024-11-08 20:05:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:07,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:07,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:07,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:07,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:07,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:07,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:07,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:07,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:07,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:07,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803703886] [2024-11-08 20:05:07,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803703886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:07,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:07,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:05:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122569307] [2024-11-08 20:05:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:05:07,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:05:07,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:05:07,587 INFO L87 Difference]: Start difference. First operand 260 states and 414 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:08,782 INFO L93 Difference]: Finished difference Result 967 states and 1528 transitions. [2024-11-08 20:05:08,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 20:05:08,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:08,789 INFO L225 Difference]: With dead ends: 967 [2024-11-08 20:05:08,789 INFO L226 Difference]: Without dead ends: 710 [2024-11-08 20:05:08,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-08 20:05:08,792 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 689 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:08,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1096 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 20:05:08,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-08 20:05:08,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 484. [2024-11-08 20:05:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.4759206798866855) internal successors, (521), 355 states have internal predecessors, (521), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-08 20:05:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 765 transitions. [2024-11-08 20:05:08,862 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 765 transitions. Word has length 252 [2024-11-08 20:05:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:08,863 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 765 transitions. [2024-11-08 20:05:08,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:08,864 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 765 transitions. [2024-11-08 20:05:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:08,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:08,867 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:08,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 20:05:08,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:08,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1520995551, now seen corresponding path program 1 times [2024-11-08 20:05:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176426204] [2024-11-08 20:05:08,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:09,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:09,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:09,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:09,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:09,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:09,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:09,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:09,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176426204] [2024-11-08 20:05:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176426204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:09,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:05:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018587417] [2024-11-08 20:05:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:05:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:09,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:05:09,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:09,585 INFO L87 Difference]: Start difference. First operand 484 states and 765 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:09,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:09,674 INFO L93 Difference]: Finished difference Result 1007 states and 1584 transitions. [2024-11-08 20:05:09,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:05:09,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:09,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:09,679 INFO L225 Difference]: With dead ends: 1007 [2024-11-08 20:05:09,680 INFO L226 Difference]: Without dead ends: 526 [2024-11-08 20:05:09,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:09,683 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 32 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:09,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 589 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:05:09,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-08 20:05:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 500. [2024-11-08 20:05:09,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 369 states have (on average 1.4769647696476964) internal successors, (545), 371 states have internal predecessors, (545), 122 states have call successors, (122), 8 states have call predecessors, (122), 8 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2024-11-08 20:05:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 789 transitions. [2024-11-08 20:05:09,747 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 789 transitions. Word has length 252 [2024-11-08 20:05:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:09,748 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 789 transitions. [2024-11-08 20:05:09,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:09,748 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 789 transitions. [2024-11-08 20:05:09,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-08 20:05:09,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:09,752 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:09,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 20:05:09,752 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:09,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:09,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1519148509, now seen corresponding path program 1 times [2024-11-08 20:05:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:09,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72853295] [2024-11-08 20:05:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:09,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:10,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:10,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:10,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:10,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:10,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:10,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:10,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72853295] [2024-11-08 20:05:10,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72853295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:10,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:10,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:05:10,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488581187] [2024-11-08 20:05:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:10,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:05:10,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:10,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:05:10,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:10,327 INFO L87 Difference]: Start difference. First operand 500 states and 789 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:10,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:10,668 INFO L93 Difference]: Finished difference Result 1328 states and 2105 transitions. [2024-11-08 20:05:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:05:10,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 252 [2024-11-08 20:05:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:10,675 INFO L225 Difference]: With dead ends: 1328 [2024-11-08 20:05:10,675 INFO L226 Difference]: Without dead ends: 831 [2024-11-08 20:05:10,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:05:10,678 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 192 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:10,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 724 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:05:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-08 20:05:10,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749. [2024-11-08 20:05:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 577 states have (on average 1.5043327556325823) internal successors, (868), 579 states have internal predecessors, (868), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:10,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1190 transitions. [2024-11-08 20:05:10,767 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1190 transitions. Word has length 252 [2024-11-08 20:05:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:10,768 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1190 transitions. [2024-11-08 20:05:10,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1190 transitions. [2024-11-08 20:05:10,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 20:05:10,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:10,772 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:10,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 20:05:10,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:10,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:10,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1561684595, now seen corresponding path program 1 times [2024-11-08 20:05:10,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:10,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090466025] [2024-11-08 20:05:10,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:12,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:12,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:12,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:12,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:12,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:12,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090466025] [2024-11-08 20:05:12,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090466025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:12,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:12,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 20:05:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894413057] [2024-11-08 20:05:12,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:12,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 20:05:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 20:05:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-08 20:05:12,339 INFO L87 Difference]: Start difference. First operand 749 states and 1190 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-08 20:05:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:14,208 INFO L93 Difference]: Finished difference Result 2531 states and 4015 transitions. [2024-11-08 20:05:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 20:05:14,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) Word has length 253 [2024-11-08 20:05:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:14,221 INFO L225 Difference]: With dead ends: 2531 [2024-11-08 20:05:14,222 INFO L226 Difference]: Without dead ends: 1992 [2024-11-08 20:05:14,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-11-08 20:05:14,226 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 982 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:14,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 776 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 20:05:14,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-08 20:05:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 795. [2024-11-08 20:05:14,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 623 states have (on average 1.4959871589085072) internal successors, (932), 625 states have internal predecessors, (932), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1254 transitions. [2024-11-08 20:05:14,430 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1254 transitions. Word has length 253 [2024-11-08 20:05:14,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:14,430 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1254 transitions. [2024-11-08 20:05:14,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 3 states have call predecessors, (39), 3 states have call successors, (39) [2024-11-08 20:05:14,430 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1254 transitions. [2024-11-08 20:05:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-08 20:05:14,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:14,435 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:14,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 20:05:14,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:14,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:14,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1702233205, now seen corresponding path program 1 times [2024-11-08 20:05:14,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:14,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451545423] [2024-11-08 20:05:14,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:14,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:14,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:14,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:14,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:14,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:14,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:14,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451545423] [2024-11-08 20:05:14,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451545423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:14,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:14,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:05:14,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199981650] [2024-11-08 20:05:14,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:14,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:05:14,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:14,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:05:14,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:05:14,635 INFO L87 Difference]: Start difference. First operand 795 states and 1254 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:14,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:14,950 INFO L93 Difference]: Finished difference Result 1532 states and 2415 transitions. [2024-11-08 20:05:14,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:05:14,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 253 [2024-11-08 20:05:14,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:14,958 INFO L225 Difference]: With dead ends: 1532 [2024-11-08 20:05:14,958 INFO L226 Difference]: Without dead ends: 941 [2024-11-08 20:05:14,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:14,962 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 140 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:14,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 754 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:05:14,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-08 20:05:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 781. [2024-11-08 20:05:15,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 609 states have (on average 1.4876847290640394) internal successors, (906), 611 states have internal predecessors, (906), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1228 transitions. [2024-11-08 20:05:15,130 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1228 transitions. Word has length 253 [2024-11-08 20:05:15,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:15,131 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1228 transitions. [2024-11-08 20:05:15,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1228 transitions. [2024-11-08 20:05:15,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 20:05:15,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:15,134 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:15,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 20:05:15,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1850281472, now seen corresponding path program 1 times [2024-11-08 20:05:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296553955] [2024-11-08 20:05:15,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:15,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:15,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:15,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:15,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:15,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:15,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:15,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:15,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:15,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296553955] [2024-11-08 20:05:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296553955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 20:05:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980989978] [2024-11-08 20:05:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:15,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 20:05:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 20:05:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:05:15,500 INFO L87 Difference]: Start difference. First operand 781 states and 1228 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:16,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:16,110 INFO L93 Difference]: Finished difference Result 1844 states and 2902 transitions. [2024-11-08 20:05:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 20:05:16,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254 [2024-11-08 20:05:16,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:16,120 INFO L225 Difference]: With dead ends: 1844 [2024-11-08 20:05:16,121 INFO L226 Difference]: Without dead ends: 1517 [2024-11-08 20:05:16,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:05:16,123 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 309 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:16,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 729 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:05:16,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-08 20:05:16,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 809. [2024-11-08 20:05:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 637 states have (on average 1.4913657770800628) internal successors, (950), 639 states have internal predecessors, (950), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1272 transitions. [2024-11-08 20:05:16,267 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1272 transitions. Word has length 254 [2024-11-08 20:05:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:16,268 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1272 transitions. [2024-11-08 20:05:16,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1272 transitions. [2024-11-08 20:05:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 20:05:16,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:16,272 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:16,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 20:05:16,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:16,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1427579646, now seen corresponding path program 1 times [2024-11-08 20:05:16,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609659352] [2024-11-08 20:05:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:16,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:16,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:16,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:16,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609659352] [2024-11-08 20:05:16,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609659352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:16,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:16,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:05:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944740916] [2024-11-08 20:05:16,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:16,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:05:16,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:16,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:05:16,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:05:16,502 INFO L87 Difference]: Start difference. First operand 809 states and 1272 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:16,849 INFO L93 Difference]: Finished difference Result 1340 states and 2112 transitions. [2024-11-08 20:05:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:05:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254 [2024-11-08 20:05:16,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:16,858 INFO L225 Difference]: With dead ends: 1340 [2024-11-08 20:05:16,858 INFO L226 Difference]: Without dead ends: 973 [2024-11-08 20:05:16,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:16,861 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 143 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:16,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 544 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 20:05:16,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-08 20:05:17,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 813. [2024-11-08 20:05:17,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 641 states have (on average 1.4758190327613105) internal successors, (946), 643 states have internal predecessors, (946), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:17,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1268 transitions. [2024-11-08 20:05:17,029 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1268 transitions. Word has length 254 [2024-11-08 20:05:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:17,030 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1268 transitions. [2024-11-08 20:05:17,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:17,030 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1268 transitions. [2024-11-08 20:05:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 20:05:17,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:17,034 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:17,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 20:05:17,034 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:17,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:17,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1287031036, now seen corresponding path program 1 times [2024-11-08 20:05:17,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:17,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640209749] [2024-11-08 20:05:17,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:17,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:17,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:17,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:17,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640209749] [2024-11-08 20:05:17,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640209749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:17,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:17,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:05:17,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133777366] [2024-11-08 20:05:17,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:17,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:05:17,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:17,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:05:17,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:17,374 INFO L87 Difference]: Start difference. First operand 813 states and 1268 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:17,951 INFO L93 Difference]: Finished difference Result 1296 states and 2032 transitions. [2024-11-08 20:05:17,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:05:17,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254 [2024-11-08 20:05:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:17,959 INFO L225 Difference]: With dead ends: 1296 [2024-11-08 20:05:17,959 INFO L226 Difference]: Without dead ends: 909 [2024-11-08 20:05:17,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 20:05:17,961 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 416 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:17,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 928 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 20:05:17,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-08 20:05:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 755. [2024-11-08 20:05:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 583 states have (on average 1.4648370497427101) internal successors, (854), 585 states have internal predecessors, (854), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1176 transitions. [2024-11-08 20:05:18,097 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1176 transitions. Word has length 254 [2024-11-08 20:05:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:18,098 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1176 transitions. [2024-11-08 20:05:18,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:18,099 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1176 transitions. [2024-11-08 20:05:18,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 20:05:18,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:18,102 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:18,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 20:05:18,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:18,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:18,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1538630839, now seen corresponding path program 1 times [2024-11-08 20:05:18,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:18,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628366058] [2024-11-08 20:05:18,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:18,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:18,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:18,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628366058] [2024-11-08 20:05:18,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628366058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:18,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:18,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:05:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518506691] [2024-11-08 20:05:18,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:18,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:05:18,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:18,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:05:18,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:05:18,413 INFO L87 Difference]: Start difference. First operand 755 states and 1176 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:18,739 INFO L93 Difference]: Finished difference Result 1750 states and 2749 transitions. [2024-11-08 20:05:18,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:05:18,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254 [2024-11-08 20:05:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:18,748 INFO L225 Difference]: With dead ends: 1750 [2024-11-08 20:05:18,748 INFO L226 Difference]: Without dead ends: 1155 [2024-11-08 20:05:18,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:18,752 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 121 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:18,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 663 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 20:05:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-08 20:05:18,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 747. [2024-11-08 20:05:18,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 575 states have (on average 1.4539130434782608) internal successors, (836), 577 states have internal predecessors, (836), 161 states have call successors, (161), 10 states have call predecessors, (161), 10 states have return successors, (161), 159 states have call predecessors, (161), 161 states have call successors, (161) [2024-11-08 20:05:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1158 transitions. [2024-11-08 20:05:18,874 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1158 transitions. Word has length 254 [2024-11-08 20:05:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:18,874 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1158 transitions. [2024-11-08 20:05:18,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:18,875 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1158 transitions. [2024-11-08 20:05:18,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 20:05:18,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:18,878 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:18,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 20:05:18,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:18,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:18,879 INFO L85 PathProgramCache]: Analyzing trace with hash -246445727, now seen corresponding path program 1 times [2024-11-08 20:05:18,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:18,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288304812] [2024-11-08 20:05:18,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:18,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:19,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:19,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288304812] [2024-11-08 20:05:19,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288304812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:19,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:19,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 20:05:19,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222573678] [2024-11-08 20:05:19,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:19,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:05:19,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 20:05:19,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:05:19,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:19,185 INFO L87 Difference]: Start difference. First operand 747 states and 1158 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:19,666 INFO L93 Difference]: Finished difference Result 1541 states and 2388 transitions. [2024-11-08 20:05:19,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:05:19,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 254 [2024-11-08 20:05:19,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:19,675 INFO L225 Difference]: With dead ends: 1541 [2024-11-08 20:05:19,675 INFO L226 Difference]: Without dead ends: 994 [2024-11-08 20:05:19,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 20:05:19,678 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 281 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:19,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 639 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 20:05:19,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-08 20:05:19,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 988. [2024-11-08 20:05:19,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 764 states have (on average 1.4541884816753927) internal successors, (1111), 768 states have internal predecessors, (1111), 209 states have call successors, (209), 14 states have call predecessors, (209), 14 states have return successors, (209), 205 states have call predecessors, (209), 209 states have call successors, (209) [2024-11-08 20:05:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1529 transitions. [2024-11-08 20:05:19,835 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1529 transitions. Word has length 254 [2024-11-08 20:05:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:19,835 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1529 transitions. [2024-11-08 20:05:19,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1529 transitions. [2024-11-08 20:05:19,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-08 20:05:19,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:19,839 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:19,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 20:05:19,840 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:19,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:19,840 INFO L85 PathProgramCache]: Analyzing trace with hash 176256099, now seen corresponding path program 1 times [2024-11-08 20:05:19,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 20:05:19,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479372288] [2024-11-08 20:05:19,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:19,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 20:05:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 20:05:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 20:05:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 20:05:20,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 20:05:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 20:05:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 20:05:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 20:05:20,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 20:05:20,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 20:05:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 20:05:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 20:05:20,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 20:05:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 20:05:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 20:05:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 20:05:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 20:05:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 20:05:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 20:05:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 20:05:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 20:05:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 20:05:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 20:05:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 20:05:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 20:05:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 20:05:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 20:05:20,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 20:05:20,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-08 20:05:20,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 20:05:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-08 20:05:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-08 20:05:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-08 20:05:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-08 20:05:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 20:05:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 20:05:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 20:05:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-08 20:05:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-08 20:05:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 20:05:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-08 20:05:20,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 20:05:20,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479372288] [2024-11-08 20:05:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479372288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 20:05:20,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133301156] [2024-11-08 20:05:20,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:20,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 20:05:20,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:05:20,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 20:05:20,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 20:05:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:20,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 20:05:20,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:05:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 1508 proven. 51 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2024-11-08 20:05:21,542 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:05:21,667 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-08 20:05:21,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:05:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 20:05:21,869 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0 at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-08 20:05:21,876 INFO L158 Benchmark]: Toolchain (without parser) took 21211.67ms. Allocated memory was 146.8MB in the beginning and 591.4MB in the end (delta: 444.6MB). Free memory was 116.1MB in the beginning and 249.8MB in the end (delta: -133.7MB). Peak memory consumption was 311.5MB. Max. memory is 16.1GB. [2024-11-08 20:05:21,876 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 113.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 20:05:21,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 435.45ms. Allocated memory is still 146.8MB. Free memory was 116.1MB in the beginning and 97.2MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 20:05:21,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.28ms. Allocated memory is still 146.8MB. Free memory was 97.2MB in the beginning and 92.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 20:05:21,880 INFO L158 Benchmark]: Boogie Preprocessor took 86.49ms. Allocated memory is still 146.8MB. Free memory was 92.6MB in the beginning and 87.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 20:05:21,880 INFO L158 Benchmark]: RCFGBuilder took 862.70ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 87.5MB in the beginning and 140.2MB in the end (delta: -52.7MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-11-08 20:05:21,881 INFO L158 Benchmark]: TraceAbstraction took 19755.77ms. Allocated memory was 186.6MB in the beginning and 591.4MB in the end (delta: 404.8MB). Free memory was 140.2MB in the beginning and 249.8MB in the end (delta: -109.6MB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. [2024-11-08 20:05:21,883 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 146.8MB. Free memory was 117.3MB in the beginning and 117.2MB in the end (delta: 113.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 435.45ms. Allocated memory is still 146.8MB. Free memory was 116.1MB in the beginning and 97.2MB in the end (delta: 18.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.28ms. Allocated memory is still 146.8MB. Free memory was 97.2MB in the beginning and 92.6MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.49ms. Allocated memory is still 146.8MB. Free memory was 92.6MB in the beginning and 87.5MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 862.70ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 87.5MB in the beginning and 140.2MB in the end (delta: -52.7MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19755.77ms. Allocated memory was 186.6MB in the beginning and 591.4MB in the end (delta: 404.8MB). Free memory was 140.2MB in the beginning and 249.8MB in the end (delta: -109.6MB). Peak memory consumption was 295.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalArgumentException: Modulus must be strictly greater one but is 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: Modulus must be strictly greater one but is 0: de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-08 20:05:21,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 20:05:24,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 20:05:24,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 20:05:24,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 20:05:24,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 20:05:24,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 20:05:24,533 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 20:05:24,533 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 20:05:24,534 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 20:05:24,534 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 20:05:24,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 20:05:24,535 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 20:05:24,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 20:05:24,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 20:05:24,536 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 20:05:24,537 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 20:05:24,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 20:05:24,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 20:05:24,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 20:05:24,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 20:05:24,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 20:05:24,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 20:05:24,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 20:05:24,544 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 20:05:24,544 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 20:05:24,544 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 20:05:24,545 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 20:05:24,545 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 20:05:24,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 20:05:24,545 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 20:05:24,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 20:05:24,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 20:05:24,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 20:05:24,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 20:05:24,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:05:24,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 20:05:24,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 20:05:24,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 20:05:24,550 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 20:05:24,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 20:05:24,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 20:05:24,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 20:05:24,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 20:05:24,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 20:05:24,551 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 -> c075bf31c8a61d5818086da4c01a54dc9522c53729e14bb5c6eb6f9ba650fc63 [2024-11-08 20:05:24,920 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 20:05:24,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 20:05:24,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 20:05:24,957 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 20:05:24,957 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 20:05:24,959 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-08 20:05:26,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 20:05:26,746 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 20:05:26,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-08 20:05:26,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d9b17fc/1cf6b683764b456885488deba9d35ca4/FLAG32d44a7fd [2024-11-08 20:05:27,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62d9b17fc/1cf6b683764b456885488deba9d35ca4 [2024-11-08 20:05:27,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 20:05:27,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 20:05:27,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 20:05:27,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 20:05:27,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 20:05:27,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a32330b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27, skipping insertion in model container [2024-11-08 20:05:27,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,112 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 20:05:27,302 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-11-08 20:05:27,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:05:27,439 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 20:05:27,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i[916,929] [2024-11-08 20:05:27,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 20:05:27,544 INFO L204 MainTranslator]: Completed translation [2024-11-08 20:05:27,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27 WrapperNode [2024-11-08 20:05:27,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 20:05:27,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 20:05:27,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 20:05:27,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 20:05:27,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,576 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,619 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-08 20:05:27,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 20:05:27,620 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 20:05:27,621 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 20:05:27,621 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 20:05:27,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,668 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 20:05:27,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,692 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,704 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,713 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,728 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 20:05:27,729 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 20:05:27,729 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 20:05:27,729 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 20:05:27,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (1/1) ... [2024-11-08 20:05:27,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 20:05:27,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 20:05:27,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 20:05:27,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 20:05:27,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 20:05:27,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 20:05:27,821 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 20:05:27,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 20:05:27,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 20:05:27,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 20:05:27,929 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 20:05:27,932 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 20:05:29,034 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 20:05:29,035 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 20:05:29,056 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 20:05:29,057 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 20:05:29,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:05:29 BoogieIcfgContainer [2024-11-08 20:05:29,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 20:05:29,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 20:05:29,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 20:05:29,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 20:05:29,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 08:05:27" (1/3) ... [2024-11-08 20:05:29,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a92f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:05:29, skipping insertion in model container [2024-11-08 20:05:29,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 08:05:27" (2/3) ... [2024-11-08 20:05:29,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a92f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 08:05:29, skipping insertion in model container [2024-11-08 20:05:29,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 08:05:29" (3/3) ... [2024-11-08 20:05:29,069 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-08 20:05:29,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 20:05:29,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 20:05:29,178 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 20:05:29,189 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;@2bbc0949, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 20:05:29,189 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 20:05:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:05:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 20:05:29,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:29,216 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:29,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:29,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1081086981, now seen corresponding path program 1 times [2024-11-08 20:05:29,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632166719] [2024-11-08 20:05:29,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:29,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:29,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:29,245 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:29,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-08 20:05:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:29,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 20:05:29,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:05:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2024-11-08 20:05:29,863 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:05:29,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:05:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632166719] [2024-11-08 20:05:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632166719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:29,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:29,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 20:05:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752218326] [2024-11-08 20:05:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:29,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 20:05:29,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:05:29,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 20:05:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:05:29,904 INFO L87 Difference]: Start difference. First operand has 114 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 20:05:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:29,960 INFO L93 Difference]: Finished difference Result 221 states and 405 transitions. [2024-11-08 20:05:29,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 20:05:29,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 246 [2024-11-08 20:05:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:29,974 INFO L225 Difference]: With dead ends: 221 [2024-11-08 20:05:29,974 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 20:05:29,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 20:05:29,987 INFO L432 NwaCegarLoop]: 177 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, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:29,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:05:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 20:05:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-08 20:05:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.434782608695652) internal successors, (99), 69 states have internal predecessors, (99), 39 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-08 20:05:30,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions. [2024-11-08 20:05:30,064 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 246 [2024-11-08 20:05:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:30,066 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 177 transitions. [2024-11-08 20:05:30,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (39), 2 states have call predecessors, (39), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2024-11-08 20:05:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions. [2024-11-08 20:05:30,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 20:05:30,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:30,074 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:30,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 20:05:30,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:30,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:30,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1790203267, now seen corresponding path program 1 times [2024-11-08 20:05:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:30,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502610743] [2024-11-08 20:05:30,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:30,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:30,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:30,288 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:30,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-08 20:05:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:30,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 20:05:30,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:05:30,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:30,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:05:30,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:05:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502610743] [2024-11-08 20:05:30,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502610743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:30,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:30,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:05:30,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703757305] [2024-11-08 20:05:30,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:30,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 20:05:30,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:05:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 20:05:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:30,793 INFO L87 Difference]: Start difference. First operand 110 states and 177 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:30,879 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2024-11-08 20:05:30,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 20:05:30,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-11-08 20:05:30,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:30,885 INFO L225 Difference]: With dead ends: 290 [2024-11-08 20:05:30,889 INFO L226 Difference]: Without dead ends: 183 [2024-11-08 20:05:30,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 20:05:30,892 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:30,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 432 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 20:05:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-08 20:05:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-08 20:05:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 116 states have (on average 1.4482758620689655) internal successors, (168), 117 states have internal predecessors, (168), 61 states have call successors, (61), 2 states have call predecessors, (61), 2 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2024-11-08 20:05:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2024-11-08 20:05:30,938 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 246 [2024-11-08 20:05:30,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:30,939 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2024-11-08 20:05:30,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2024-11-08 20:05:30,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-08 20:05:30,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:30,946 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:30,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 20:05:31,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:31,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:31,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:31,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2009057985, now seen corresponding path program 1 times [2024-11-08 20:05:31,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:31,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651528044] [2024-11-08 20:05:31,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:31,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:31,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:31,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:31,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 20:05:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:31,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 20:05:31,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:05:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:33,147 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:05:33,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:05:33,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651528044] [2024-11-08 20:05:33,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651528044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:33,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:33,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 20:05:33,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372276002] [2024-11-08 20:05:33,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:33,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 20:05:33,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:05:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 20:05:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:33,153 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:33,731 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2024-11-08 20:05:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 20:05:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 246 [2024-11-08 20:05:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:33,740 INFO L225 Difference]: With dead ends: 498 [2024-11-08 20:05:33,740 INFO L226 Difference]: Without dead ends: 321 [2024-11-08 20:05:33,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 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-08 20:05:33,742 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:33,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 600 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:05:33,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-08 20:05:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 287. [2024-11-08 20:05:33,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 183 states have (on average 1.459016393442623) internal successors, (267), 184 states have internal predecessors, (267), 100 states have call successors, (100), 3 states have call predecessors, (100), 3 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-08 20:05:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2024-11-08 20:05:33,797 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 246 [2024-11-08 20:05:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:33,798 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2024-11-08 20:05:33,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2024-11-08 20:05:33,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-08 20:05:33,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:33,803 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:33,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 20:05:34,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:34,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:34,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash -677652604, now seen corresponding path program 1 times [2024-11-08 20:05:34,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:34,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661033770] [2024-11-08 20:05:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:34,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:34,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:34,009 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:34,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-08 20:05:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:34,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 20:05:34,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:05:34,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 464 proven. 105 refuted. 0 times theorem prover too weak. 2395 trivial. 0 not checked. [2024-11-08 20:05:34,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 20:05:35,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 9 proven. 105 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2024-11-08 20:05:35,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:05:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661033770] [2024-11-08 20:05:35,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661033770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 20:05:35,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 20:05:35,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-08 20:05:35,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574777540] [2024-11-08 20:05:35,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 20:05:35,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 20:05:35,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:05:35,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 20:05:35,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 20:05:35,175 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-11-08 20:05:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:35,797 INFO L93 Difference]: Finished difference Result 488 states and 775 transitions. [2024-11-08 20:05:35,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 20:05:35,801 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) Word has length 247 [2024-11-08 20:05:35,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:35,805 INFO L225 Difference]: With dead ends: 488 [2024-11-08 20:05:35,805 INFO L226 Difference]: Without dead ends: 311 [2024-11-08 20:05:35,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-08 20:05:35,807 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 373 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:35,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 307 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 20:05:35,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-08 20:05:35,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2024-11-08 20:05:35,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 192 states have (on average 1.4166666666666667) internal successors, (272), 193 states have internal predecessors, (272), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-08 20:05:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions. [2024-11-08 20:05:35,848 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 247 [2024-11-08 20:05:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:35,849 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 472 transitions. [2024-11-08 20:05:35,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 2 states have call successors, (74), 2 states have call predecessors, (74), 4 states have return successors, (75), 2 states have call predecessors, (75), 2 states have call successors, (75) [2024-11-08 20:05:35,849 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions. [2024-11-08 20:05:35,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-08 20:05:35,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:35,853 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:35,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-08 20:05:36,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:36,055 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:36,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1200151676, now seen corresponding path program 1 times [2024-11-08 20:05:36,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:36,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881921943] [2024-11-08 20:05:36,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:36,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:36,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:36,061 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:36,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 20:05:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:36,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 20:05:36,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 20:05:37,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2024-11-08 20:05:37,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 20:05:37,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 20:05:37,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881921943] [2024-11-08 20:05:37,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881921943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 20:05:37,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 20:05:37,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 20:05:37,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118475693] [2024-11-08 20:05:37,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 20:05:37,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 20:05:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 20:05:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 20:05:37,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 20:05:37,025 INFO L87 Difference]: Start difference. First operand 299 states and 472 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:38,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 20:05:38,002 INFO L93 Difference]: Finished difference Result 492 states and 773 transitions. [2024-11-08 20:05:38,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 20:05:38,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) Word has length 248 [2024-11-08 20:05:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 20:05:38,007 INFO L225 Difference]: With dead ends: 492 [2024-11-08 20:05:38,007 INFO L226 Difference]: Without dead ends: 307 [2024-11-08 20:05:38,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 20:05:38,011 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 20:05:38,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-08 20:05:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-08 20:05:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2024-11-08 20:05:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 192 states have (on average 1.3958333333333333) internal successors, (268), 193 states have internal predecessors, (268), 100 states have call successors, (100), 6 states have call predecessors, (100), 6 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-08 20:05:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions. [2024-11-08 20:05:38,080 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 248 [2024-11-08 20:05:38,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 20:05:38,081 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 468 transitions. [2024-11-08 20:05:38,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (39), 1 states have call predecessors, (39), 1 states have return successors, (39), 1 states have call predecessors, (39), 1 states have call successors, (39) [2024-11-08 20:05:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions. [2024-11-08 20:05:38,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-08 20:05:38,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 20:05:38,089 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 20:05:38,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-08 20:05:38,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:38,291 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 20:05:38,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 20:05:38,291 INFO L85 PathProgramCache]: Analyzing trace with hash 122871261, now seen corresponding path program 1 times [2024-11-08 20:05:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 20:05:38,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897637143] [2024-11-08 20:05:38,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 20:05:38,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 20:05:38,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 20:05:38,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 20:05:38,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-08 20:05:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 20:05:38,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 20:05:38,651 INFO L278 TraceCheckSpWp]: Computing forward predicates...