./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:44:21,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:44:22,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:44:22,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:44:22,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:44:22,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:44:22,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:44:22,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:44:22,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:44:22,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:44:22,090 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:44:22,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:44:22,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:44:22,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:44:22,092 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:44:22,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:44:22,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:44:22,092 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:44:22,092 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:44:22,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:44:22,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:44:22,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:44:22,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:44:22,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:44:22,094 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:44:22,094 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:44:22,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:44:22,094 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:44:22,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:44:22,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:44:22,095 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:44:22,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:44:22,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:44:22,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:44:22,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:44:22,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:44:22,097 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-12 01:44:22,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:44:22,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:44:22,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:44:22,335 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:44:22,335 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:44:22,337 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-12 01:44:23,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:44:23,759 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:44:23,759 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-12 01:44:23,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f65d06a/0f41babace844ebabcabd10f3bdb7c89/FLAG4a62c8719 [2024-11-12 01:44:24,136 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f65d06a/0f41babace844ebabcabd10f3bdb7c89 [2024-11-12 01:44:24,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:44:24,140 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:44:24,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:44:24,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:44:24,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:44:24,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62c8e320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24, skipping insertion in model container [2024-11-12 01:44:24,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:44:24,334 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-12 01:44:24,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:44:24,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:44:24,442 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-12 01:44:24,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:44:24,504 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:44:24,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24 WrapperNode [2024-11-12 01:44:24,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:44:24,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:44:24,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:44:24,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:44:24,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,556 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-11-12 01:44:24,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:44:24,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:44:24,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:44:24,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:44:24,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,570 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,583 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-12 01:44:24,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,602 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,604 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:44:24,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:44:24,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:44:24,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:44:24,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (1/1) ... [2024-11-12 01:44:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:44:24,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:44:24,654 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-12 01:44:24,656 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-12 01:44:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:44:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:44:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:44:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:44:24,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:44:24,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:44:24,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:44:24,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:44:25,111 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 01:44:25,111 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:44:25,127 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:44:25,127 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:44:25,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:44:25 BoogieIcfgContainer [2024-11-12 01:44:25,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:44:25,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:44:25,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:44:25,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:44:25,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:44:24" (1/3) ... [2024-11-12 01:44:25,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396f6132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:44:25, skipping insertion in model container [2024-11-12 01:44:25,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:24" (2/3) ... [2024-11-12 01:44:25,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@396f6132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:44:25, skipping insertion in model container [2024-11-12 01:44:25,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:44:25" (3/3) ... [2024-11-12 01:44:25,135 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-12 01:44:25,147 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:44:25,148 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:44:25,200 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:44:25,205 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;@11087f64, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:44:25,206 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:44:25,210 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-12 01:44:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-12 01:44:25,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:25,223 INFO L218 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-12 01:44:25,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:25,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash -444858248, now seen corresponding path program 1 times [2024-11-12 01:44:25,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:25,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190279113] [2024-11-12 01:44:25,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:25,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:25,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:25,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:25,963 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-12 01:44:25,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:25,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190279113] [2024-11-12 01:44:25,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190279113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:25,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:25,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:44:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541347301] [2024-11-12 01:44:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:25,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:44:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:25,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:44:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:44:25,997 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-12 01:44:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:26,079 INFO L93 Difference]: Finished difference Result 326 states and 616 transitions. [2024-11-12 01:44:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:44:26,082 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-12 01:44:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:26,094 INFO L225 Difference]: With dead ends: 326 [2024-11-12 01:44:26,095 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 01:44:26,099 INFO L434 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-12 01:44:26,104 INFO L435 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-12 01:44:26,107 INFO L436 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-12 01:44:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 01:44:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2024-11-12 01:44:26,160 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-12 01:44:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 208 transitions. [2024-11-12 01:44:26,165 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 208 transitions. Word has length 250 [2024-11-12 01:44:26,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:26,168 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 208 transitions. [2024-11-12 01:44:26,168 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-12 01:44:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 208 transitions. [2024-11-12 01:44:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-12 01:44:26,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:26,174 INFO L218 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-12 01:44:26,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:44:26,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:26,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash -659469682, now seen corresponding path program 1 times [2024-11-12 01:44:26,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:26,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731808697] [2024-11-12 01:44:26,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:26,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:26,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:26,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:26,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,572 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-12 01:44:26,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:26,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731808697] [2024-11-12 01:44:26,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731808697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:26,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:26,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:44:26,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463145124] [2024-11-12 01:44:26,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:26,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:26,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:26,579 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-12 01:44:26,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:26,805 INFO L93 Difference]: Finished difference Result 351 states and 567 transitions. [2024-11-12 01:44:26,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:26,805 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-12 01:44:26,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:26,810 INFO L225 Difference]: With dead ends: 351 [2024-11-12 01:44:26,810 INFO L226 Difference]: Without dead ends: 225 [2024-11-12 01:44:26,810 INFO L434 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-12 01:44:26,811 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 288 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:26,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 659 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:44:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-12 01:44:26,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2024-11-12 01:44:26,834 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-12 01:44:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions. [2024-11-12 01:44:26,835 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 251 [2024-11-12 01:44:26,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:26,836 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 238 transitions. [2024-11-12 01:44:26,836 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-12 01:44:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions. [2024-11-12 01:44:26,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:26,838 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:26,839 INFO L218 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-12 01:44:26,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:44:26,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:26,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:26,840 INFO L85 PathProgramCache]: Analyzing trace with hash 713954525, now seen corresponding path program 1 times [2024-11-12 01:44:26,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:26,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340758398] [2024-11-12 01:44:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:26,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:26,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:26,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,017 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-12 01:44:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340758398] [2024-11-12 01:44:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340758398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:44:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764498742] [2024-11-12 01:44:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:44:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:27,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:44:27,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:44:27,020 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-12 01:44:27,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:27,042 INFO L93 Difference]: Finished difference Result 296 states and 475 transitions. [2024-11-12 01:44:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:44:27,043 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-12 01:44:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:27,044 INFO L225 Difference]: With dead ends: 296 [2024-11-12 01:44:27,044 INFO L226 Difference]: Without dead ends: 150 [2024-11-12 01:44:27,045 INFO L434 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-12 01:44:27,046 INFO L435 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-12 01:44:27,046 INFO L436 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-12 01:44:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-12 01:44:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-12 01:44:27,064 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-12 01:44:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions. [2024-11-12 01:44:27,065 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 252 [2024-11-12 01:44:27,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:27,068 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 239 transitions. [2024-11-12 01:44:27,068 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-12 01:44:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions. [2024-11-12 01:44:27,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:27,072 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:27,072 INFO L218 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-12 01:44:27,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:44:27,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:27,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1280190181, now seen corresponding path program 1 times [2024-11-12 01:44:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:27,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674363719] [2024-11-12 01:44:27,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,229 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-12 01:44:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674363719] [2024-11-12 01:44:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674363719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:27,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:27,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:44:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624487445] [2024-11-12 01:44:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:27,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:44:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:27,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:44:27,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:44:27,232 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-12 01:44:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:27,266 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2024-11-12 01:44:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:44:27,267 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-12 01:44:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:27,269 INFO L225 Difference]: With dead ends: 408 [2024-11-12 01:44:27,269 INFO L226 Difference]: Without dead ends: 261 [2024-11-12 01:44:27,270 INFO L434 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-12 01:44:27,271 INFO L435 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-12 01:44:27,271 INFO L436 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-12 01:44:27,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-12 01:44:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2024-11-12 01:44:27,296 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-12 01:44:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 410 transitions. [2024-11-12 01:44:27,298 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 410 transitions. Word has length 252 [2024-11-12 01:44:27,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:27,298 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 410 transitions. [2024-11-12 01:44:27,299 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-12 01:44:27,299 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 410 transitions. [2024-11-12 01:44:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:27,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:27,301 INFO L218 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-12 01:44:27,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 01:44:27,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:27,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 643037853, now seen corresponding path program 1 times [2024-11-12 01:44:27,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:27,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977098270] [2024-11-12 01:44:27,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:27,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:27,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:27,599 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-12 01:44:27,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:27,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977098270] [2024-11-12 01:44:27,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977098270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:27,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:27,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:44:27,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865380017] [2024-11-12 01:44:27,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:27,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:44:27,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:27,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:44:27,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:44:27,602 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-12 01:44:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:27,818 INFO L93 Difference]: Finished difference Result 671 states and 1071 transitions. [2024-11-12 01:44:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 01:44:27,819 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-12 01:44:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:27,825 INFO L225 Difference]: With dead ends: 671 [2024-11-12 01:44:27,825 INFO L226 Difference]: Without dead ends: 416 [2024-11-12 01:44:27,826 INFO L434 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-12 01:44:27,827 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 335 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 01:44:27,827 INFO L436 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-12 01:44:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-12 01:44:27,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 260. [2024-11-12 01:44:27,844 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-12 01:44:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions. [2024-11-12 01:44:27,845 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252 [2024-11-12 01:44:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:27,857 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 414 transitions. [2024-11-12 01:44:27,857 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-12 01:44:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions. [2024-11-12 01:44:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:27,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:27,860 INFO L218 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-12 01:44:27,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 01:44:27,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:27,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:27,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1162400481, now seen corresponding path program 1 times [2024-11-12 01:44:27,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:27,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079955831] [2024-11-12 01:44:27,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:27,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:27,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:28,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:28,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,350 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-12 01:44:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079955831] [2024-11-12 01:44:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079955831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:28,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:28,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:44:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142479963] [2024-11-12 01:44:28,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:28,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:44:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:44:28,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:44:28,351 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-12 01:44:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:28,594 INFO L93 Difference]: Finished difference Result 723 states and 1151 transitions. [2024-11-12 01:44:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 01:44:28,595 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-12 01:44:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:28,598 INFO L225 Difference]: With dead ends: 723 [2024-11-12 01:44:28,598 INFO L226 Difference]: Without dead ends: 466 [2024-11-12 01:44:28,599 INFO L434 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-12 01:44:28,601 INFO L435 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:28,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 500 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:44:28,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-12 01:44:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 260. [2024-11-12 01:44:28,627 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-12 01:44:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions. [2024-11-12 01:44:28,628 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252 [2024-11-12 01:44:28,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:28,629 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 414 transitions. [2024-11-12 01:44:28,629 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-12 01:44:28,629 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions. [2024-11-12 01:44:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:28,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:28,633 INFO L218 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-12 01:44:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 01:44:28,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash -703347101, now seen corresponding path program 1 times [2024-11-12 01:44:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:28,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893563121] [2024-11-12 01:44:28,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:28,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:28,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:28,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:28,953 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-12 01:44:28,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:28,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893563121] [2024-11-12 01:44:28,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893563121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:28,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:28,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 01:44:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861776336] [2024-11-12 01:44:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:28,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:44:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:28,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:44:28,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:44:28,955 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-12 01:44:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:29,777 INFO L93 Difference]: Finished difference Result 967 states and 1528 transitions. [2024-11-12 01:44:29,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 01:44:29,777 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-12 01:44:29,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:29,781 INFO L225 Difference]: With dead ends: 967 [2024-11-12 01:44:29,781 INFO L226 Difference]: Without dead ends: 710 [2024-11-12 01:44:29,782 INFO L434 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-12 01:44:29,782 INFO L435 NwaCegarLoop]: 281 mSDtfsCounter, 689 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:29,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1096 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:44:29,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-12 01:44:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 484. [2024-11-12 01:44:29,835 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-12 01:44:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 765 transitions. [2024-11-12 01:44:29,839 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 765 transitions. Word has length 252 [2024-11-12 01:44:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:29,840 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 765 transitions. [2024-11-12 01:44:29,840 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-12 01:44:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 765 transitions. [2024-11-12 01:44:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:29,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:29,842 INFO L218 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-12 01:44:29,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 01:44:29,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:29,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:29,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1520995551, now seen corresponding path program 1 times [2024-11-12 01:44:29,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:29,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201068478] [2024-11-12 01:44:29,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:29,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:30,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,300 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-12 01:44:30,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:30,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201068478] [2024-11-12 01:44:30,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201068478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:30,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:30,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:44:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095827347] [2024-11-12 01:44:30,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:30,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:30,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:30,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:30,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:30,302 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-12 01:44:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:30,380 INFO L93 Difference]: Finished difference Result 1007 states and 1584 transitions. [2024-11-12 01:44:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:30,381 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-12 01:44:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:30,383 INFO L225 Difference]: With dead ends: 1007 [2024-11-12 01:44:30,383 INFO L226 Difference]: Without dead ends: 526 [2024-11-12 01:44:30,384 INFO L434 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-12 01:44:30,386 INFO L435 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-12 01:44:30,386 INFO L436 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-12 01:44:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-12 01:44:30,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 500. [2024-11-12 01:44:30,424 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-12 01:44:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 789 transitions. [2024-11-12 01:44:30,426 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 789 transitions. Word has length 252 [2024-11-12 01:44:30,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:30,427 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 789 transitions. [2024-11-12 01:44:30,427 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-12 01:44:30,427 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 789 transitions. [2024-11-12 01:44:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-12 01:44:30,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:30,429 INFO L218 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-12 01:44:30,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 01:44:30,429 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:30,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:30,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1519148509, now seen corresponding path program 1 times [2024-11-12 01:44:30,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:30,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527833459] [2024-11-12 01:44:30,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:30,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:30,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:30,795 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-12 01:44:30,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:30,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527833459] [2024-11-12 01:44:30,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527833459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:30,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:30,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:44:30,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542731949] [2024-11-12 01:44:30,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:30,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:30,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:30,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:30,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:30,798 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-12 01:44:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:31,038 INFO L93 Difference]: Finished difference Result 1328 states and 2105 transitions. [2024-11-12 01:44:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:31,038 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-12 01:44:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:31,042 INFO L225 Difference]: With dead ends: 1328 [2024-11-12 01:44:31,042 INFO L226 Difference]: Without dead ends: 831 [2024-11-12 01:44:31,044 INFO L434 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-12 01:44:31,044 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 192 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 01:44:31,045 INFO L436 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-12 01:44:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-12 01:44:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749. [2024-11-12 01:44:31,101 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-12 01:44:31,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1190 transitions. [2024-11-12 01:44:31,105 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1190 transitions. Word has length 252 [2024-11-12 01:44:31,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:31,105 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1190 transitions. [2024-11-12 01:44:31,105 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-12 01:44:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1190 transitions. [2024-11-12 01:44:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-12 01:44:31,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:31,107 INFO L218 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-12 01:44:31,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 01:44:31,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:31,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:31,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1561684595, now seen corresponding path program 1 times [2024-11-12 01:44:31,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:31,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747996441] [2024-11-12 01:44:31,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:31,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:32,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:32,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:32,214 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-12 01:44:32,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747996441] [2024-11-12 01:44:32,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747996441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:32,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:32,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 01:44:32,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334896427] [2024-11-12 01:44:32,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:32,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 01:44:32,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:32,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 01:44:32,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:44:32,216 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-12 01:44:33,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:33,466 INFO L93 Difference]: Finished difference Result 2531 states and 4015 transitions. [2024-11-12 01:44:33,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 01:44:33,466 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-12 01:44:33,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:33,477 INFO L225 Difference]: With dead ends: 2531 [2024-11-12 01:44:33,478 INFO L226 Difference]: Without dead ends: 1992 [2024-11-12 01:44:33,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-11-12 01:44:33,480 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 982 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:33,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 776 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 01:44:33,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-12 01:44:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 795. [2024-11-12 01:44:33,614 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-12 01:44:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1254 transitions. [2024-11-12 01:44:33,619 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1254 transitions. Word has length 253 [2024-11-12 01:44:33,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:33,620 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1254 transitions. [2024-11-12 01:44:33,620 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-12 01:44:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1254 transitions. [2024-11-12 01:44:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-12 01:44:33,622 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:33,623 INFO L218 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-12 01:44:33,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 01:44:33,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:33,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1702233205, now seen corresponding path program 1 times [2024-11-12 01:44:33,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:33,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538662493] [2024-11-12 01:44:33,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:33,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:33,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:33,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:33,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:33,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:33,748 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-12 01:44:33,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:33,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538662493] [2024-11-12 01:44:33,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538662493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:33,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:33,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:44:33,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541837205] [2024-11-12 01:44:33,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:33,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:44:33,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:44:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:44:33,750 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-12 01:44:33,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:33,957 INFO L93 Difference]: Finished difference Result 1532 states and 2415 transitions. [2024-11-12 01:44:33,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:44:33,958 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-12 01:44:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:33,963 INFO L225 Difference]: With dead ends: 1532 [2024-11-12 01:44:33,963 INFO L226 Difference]: Without dead ends: 941 [2024-11-12 01:44:33,965 INFO L434 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-12 01:44:33,965 INFO L435 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-12 01:44:33,966 INFO L436 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-12 01:44:33,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-12 01:44:34,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 781. [2024-11-12 01:44:34,069 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-12 01:44:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1228 transitions. [2024-11-12 01:44:34,075 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1228 transitions. Word has length 253 [2024-11-12 01:44:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:34,076 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1228 transitions. [2024-11-12 01:44:34,076 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-12 01:44:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1228 transitions. [2024-11-12 01:44:34,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 01:44:34,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:34,078 INFO L218 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-12 01:44:34,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 01:44:34,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:34,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:34,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1850281472, now seen corresponding path program 1 times [2024-11-12 01:44:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:34,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004601701] [2024-11-12 01:44:34,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:34,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:34,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:34,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:34,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:34,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:34,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:34,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,324 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-12 01:44:34,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:34,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004601701] [2024-11-12 01:44:34,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004601701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:34,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:34,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 01:44:34,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780396835] [2024-11-12 01:44:34,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:34,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 01:44:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:34,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 01:44:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-12 01:44:34,326 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-12 01:44:34,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:34,734 INFO L93 Difference]: Finished difference Result 1844 states and 2902 transitions. [2024-11-12 01:44:34,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 01:44:34,735 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-12 01:44:34,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:34,741 INFO L225 Difference]: With dead ends: 1844 [2024-11-12 01:44:34,741 INFO L226 Difference]: Without dead ends: 1517 [2024-11-12 01:44:34,742 INFO L434 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-12 01:44:34,743 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 309 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:34,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 729 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:44:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-12 01:44:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 809. [2024-11-12 01:44:34,835 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-12 01:44:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1272 transitions. [2024-11-12 01:44:34,840 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1272 transitions. Word has length 254 [2024-11-12 01:44:34,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:34,840 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1272 transitions. [2024-11-12 01:44:34,841 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-12 01:44:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1272 transitions. [2024-11-12 01:44:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 01:44:34,842 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:34,843 INFO L218 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-12 01:44:34,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 01:44:34,843 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1427579646, now seen corresponding path program 1 times [2024-11-12 01:44:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:34,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403400924] [2024-11-12 01:44:34,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:34,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:34,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:34,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:34,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,008 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-12 01:44:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403400924] [2024-11-12 01:44:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403400924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:44:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523806637] [2024-11-12 01:44:35,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:44:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:35,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:44:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:44:35,011 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-12 01:44:35,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:35,245 INFO L93 Difference]: Finished difference Result 1340 states and 2112 transitions. [2024-11-12 01:44:35,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:44:35,245 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-12 01:44:35,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:35,250 INFO L225 Difference]: With dead ends: 1340 [2024-11-12 01:44:35,250 INFO L226 Difference]: Without dead ends: 973 [2024-11-12 01:44:35,251 INFO L434 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-12 01:44:35,251 INFO L435 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-12 01:44:35,252 INFO L436 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-12 01:44:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-12 01:44:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 813. [2024-11-12 01:44:35,329 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-12 01:44:35,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1268 transitions. [2024-11-12 01:44:35,332 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1268 transitions. Word has length 254 [2024-11-12 01:44:35,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:35,333 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1268 transitions. [2024-11-12 01:44:35,333 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-12 01:44:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1268 transitions. [2024-11-12 01:44:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 01:44:35,335 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:35,335 INFO L218 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-12 01:44:35,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 01:44:35,335 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:35,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1287031036, now seen corresponding path program 1 times [2024-11-12 01:44:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:35,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701914994] [2024-11-12 01:44:35,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:35,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:35,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:35,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:35,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:35,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:35,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:35,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:35,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:35,577 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-12 01:44:35,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:35,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701914994] [2024-11-12 01:44:35,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701914994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:35,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:44:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107239256] [2024-11-12 01:44:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:35,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:35,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:35,579 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-12 01:44:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:35,949 INFO L93 Difference]: Finished difference Result 1296 states and 2032 transitions. [2024-11-12 01:44:35,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:35,949 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-12 01:44:35,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:35,954 INFO L225 Difference]: With dead ends: 1296 [2024-11-12 01:44:35,955 INFO L226 Difference]: Without dead ends: 909 [2024-11-12 01:44:35,956 INFO L434 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-12 01:44:35,957 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 416 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:35,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 928 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:44:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-12 01:44:36,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 755. [2024-11-12 01:44:36,040 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-12 01:44:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1176 transitions. [2024-11-12 01:44:36,043 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1176 transitions. Word has length 254 [2024-11-12 01:44:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:36,044 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1176 transitions. [2024-11-12 01:44:36,044 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-12 01:44:36,044 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1176 transitions. [2024-11-12 01:44:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 01:44:36,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:36,046 INFO L218 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-12 01:44:36,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 01:44:36,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:36,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1538630839, now seen corresponding path program 1 times [2024-11-12 01:44:36,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:36,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166111239] [2024-11-12 01:44:36,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:36,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:36,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,254 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-12 01:44:36,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166111239] [2024-11-12 01:44:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166111239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:36,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:36,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:44:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801942866] [2024-11-12 01:44:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:36,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:44:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:36,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:44:36,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:44:36,256 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-12 01:44:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:36,482 INFO L93 Difference]: Finished difference Result 1750 states and 2749 transitions. [2024-11-12 01:44:36,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:44:36,483 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-12 01:44:36,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:36,488 INFO L225 Difference]: With dead ends: 1750 [2024-11-12 01:44:36,488 INFO L226 Difference]: Without dead ends: 1155 [2024-11-12 01:44:36,491 INFO L434 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-12 01:44:36,491 INFO L435 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:36,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 663 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 01:44:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-12 01:44:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 747. [2024-11-12 01:44:36,586 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-12 01:44:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1158 transitions. [2024-11-12 01:44:36,589 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1158 transitions. Word has length 254 [2024-11-12 01:44:36,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:36,589 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1158 transitions. [2024-11-12 01:44:36,589 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-12 01:44:36,589 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1158 transitions. [2024-11-12 01:44:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 01:44:36,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:36,591 INFO L218 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-12 01:44:36,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 01:44:36,591 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:36,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:36,591 INFO L85 PathProgramCache]: Analyzing trace with hash -246445727, now seen corresponding path program 1 times [2024-11-12 01:44:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:36,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059224670] [2024-11-12 01:44:36,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:36,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:36,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:36,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:36,764 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-12 01:44:36,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:36,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059224670] [2024-11-12 01:44:36,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059224670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:36,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:36,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:44:36,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768009904] [2024-11-12 01:44:36,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:36,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:44:36,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:36,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:36,767 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-12 01:44:37,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:37,103 INFO L93 Difference]: Finished difference Result 1541 states and 2388 transitions. [2024-11-12 01:44:37,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:37,104 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-12 01:44:37,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:37,108 INFO L225 Difference]: With dead ends: 1541 [2024-11-12 01:44:37,108 INFO L226 Difference]: Without dead ends: 994 [2024-11-12 01:44:37,110 INFO L434 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-12 01:44:37,110 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 281 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:37,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 639 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:44:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-12 01:44:37,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 988. [2024-11-12 01:44:37,251 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-12 01:44:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1529 transitions. [2024-11-12 01:44:37,255 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1529 transitions. Word has length 254 [2024-11-12 01:44:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:37,255 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1529 transitions. [2024-11-12 01:44:37,256 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-12 01:44:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1529 transitions. [2024-11-12 01:44:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-12 01:44:37,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:37,258 INFO L218 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-12 01:44:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 01:44:37,258 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 176256099, now seen corresponding path program 1 times [2024-11-12 01:44:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:44:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092896597] [2024-11-12 01:44:37,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:44:37,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:44:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:44:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:44:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:44:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:44:37,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:44:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:44:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:44:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:44:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:44:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:44:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:44:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 01:44:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:44:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 01:44:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 01:44:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 01:44:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:44:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:44:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:44:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 01:44:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 01:44:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 01:44:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 01:44:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 01:44:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:44:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:44:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 01:44:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-12 01:44:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 01:44:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-12 01:44:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 01:44:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 01:44:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 01:44:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-12 01:44:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-12 01:44:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-12 01:44:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-12 01:44:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-12 01:44:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,735 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-12 01:44:37,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:44:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092896597] [2024-11-12 01:44:37,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092896597] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:44:37,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529694300] [2024-11-12 01:44:37,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:37,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:44:37,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:44:37,738 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-12 01:44:37,739 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-12 01:44:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:37,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 01:44:37,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:38,419 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-12 01:44:38,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:44:38,502 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-12 01:44:38,518 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-12 01:44:38,706 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-12 01:44:38,708 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:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) 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:316) 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-12 01:44:38,711 INFO L158 Benchmark]: Toolchain (without parser) took 14571.59ms. Allocated memory was 134.2MB in the beginning and 539.0MB in the end (delta: 404.8MB). Free memory was 64.8MB in the beginning and 347.7MB in the end (delta: -282.8MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2024-11-12 01:44:38,711 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 134.2MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:44:38,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 363.74ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 64.7MB in the beginning and 140.9MB in the end (delta: -76.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2024-11-12 01:44:38,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.41ms. Allocated memory is still 178.3MB. Free memory was 140.9MB in the beginning and 136.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:44:38,712 INFO L158 Benchmark]: Boogie Preprocessor took 59.96ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 131.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:44:38,712 INFO L158 Benchmark]: RCFGBuilder took 510.32ms. Allocated memory is still 178.3MB. Free memory was 131.8MB in the beginning and 96.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-12 01:44:38,712 INFO L158 Benchmark]: TraceAbstraction took 13581.88ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 96.1MB in the beginning and 347.7MB in the end (delta: -251.5MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2024-11-12 01:44:38,713 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.18ms. Allocated memory is still 134.2MB. Free memory is still 96.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 363.74ms. Allocated memory was 134.2MB in the beginning and 178.3MB in the end (delta: 44.0MB). Free memory was 64.7MB in the beginning and 140.9MB in the end (delta: -76.3MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.41ms. Allocated memory is still 178.3MB. Free memory was 140.9MB in the beginning and 136.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.96ms. Allocated memory is still 178.3MB. Free memory was 136.8MB in the beginning and 131.8MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 510.32ms. Allocated memory is still 178.3MB. Free memory was 131.8MB in the beginning and 96.1MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13581.88ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 96.1MB in the beginning and 347.7MB in the end (delta: -251.5MB). Peak memory consumption was 109.9MB. 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-12 01:44:38,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:44:40,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:44:40,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:44:40,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:44:40,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:44:40,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:44:40,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:44:40,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:44:40,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:44:40,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:44:40,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:44:40,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:44:40,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:44:40,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:44:40,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:44:40,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:44:40,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:44:40,656 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:44:40,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:44:40,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:44:40,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:44:40,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:44:40,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:44:40,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:44:40,660 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:44:40,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:44:40,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:44:40,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:44:40,661 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:44:40,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:44:40,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:44:40,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:44:40,662 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:44:40,662 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:44:40,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:44:40,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:44:40,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:44:40,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:44:40,663 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-12 01:44:40,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:44:40,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:44:40,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:44:40,941 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:44:40,942 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:44:40,942 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-12 01:44:42,216 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:44:42,426 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:44:42,426 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-12 01:44:42,436 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c439e74b/803915be976f44e9913374cfb145f870/FLAG6b170af1c [2024-11-12 01:44:42,804 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c439e74b/803915be976f44e9913374cfb145f870 [2024-11-12 01:44:42,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:44:42,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:44:42,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:44:42,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:44:42,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:44:42,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:44:42" (1/1) ... [2024-11-12 01:44:42,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f9061c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:42, skipping insertion in model container [2024-11-12 01:44:42,823 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:44:42" (1/1) ... [2024-11-12 01:44:42,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:44:42,999 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-12 01:44:43,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:44:43,111 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:44:43,121 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-12 01:44:43,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:44:43,194 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:44:43,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43 WrapperNode [2024-11-12 01:44:43,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:44:43,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:44:43,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:44:43,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:44:43,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,255 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-12 01:44:43,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:44:43,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:44:43,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:44:43,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:44:43,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,302 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-12 01:44:43,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,319 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,325 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:44:43,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:44:43,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:44:43,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:44:43,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (1/1) ... [2024-11-12 01:44:43,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:44:43,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:44:43,372 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-12 01:44:43,376 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-12 01:44:43,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:44:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:44:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:44:43,413 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:44:43,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:44:43,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:44:43,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:44:43,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:44:44,148 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 01:44:44,148 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:44:44,165 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:44:44,165 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:44:44,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:44:44 BoogieIcfgContainer [2024-11-12 01:44:44,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:44:44,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:44:44,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:44:44,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:44:44,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:44:42" (1/3) ... [2024-11-12 01:44:44,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2c59f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:44:44, skipping insertion in model container [2024-11-12 01:44:44,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:44:43" (2/3) ... [2024-11-12 01:44:44,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e2c59f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:44:44, skipping insertion in model container [2024-11-12 01:44:44,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:44:44" (3/3) ... [2024-11-12 01:44:44,175 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-12 01:44:44,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:44:44,188 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:44:44,246 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:44:44,251 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;@77889ae9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:44:44,252 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:44:44,256 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-12 01:44:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-12 01:44:44,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:44,272 INFO L218 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-12 01:44:44,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:44,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1081086981, now seen corresponding path program 1 times [2024-11-12 01:44:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:44,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905771134] [2024-11-12 01:44:44,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:44,295 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-12 01:44:44,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:44,298 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-12 01:44:44,299 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-12 01:44:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:44,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:44:44,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:44,722 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-12 01:44:44,722 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:44:44,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905771134] [2024-11-12 01:44:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905771134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:44,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:44:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338962999] [2024-11-12 01:44:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:44,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:44:44,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:44,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:44:44,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:44:44,756 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-12 01:44:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:44,791 INFO L93 Difference]: Finished difference Result 221 states and 405 transitions. [2024-11-12 01:44:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:44:44,794 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-12 01:44:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:44,803 INFO L225 Difference]: With dead ends: 221 [2024-11-12 01:44:44,803 INFO L226 Difference]: Without dead ends: 110 [2024-11-12 01:44:44,808 INFO L434 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-12 01:44:44,812 INFO L435 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-12 01:44:44,813 INFO L436 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-12 01:44:44,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-12 01:44:44,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-12 01:44:44,854 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-12 01:44:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions. [2024-11-12 01:44:44,859 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 246 [2024-11-12 01:44:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:44,860 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 177 transitions. [2024-11-12 01:44:44,860 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-12 01:44:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions. [2024-11-12 01:44:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-12 01:44:44,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:44,865 INFO L218 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-12 01:44:44,877 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 (2)] Ended with exit code 0 [2024-11-12 01:44:45,065 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-12 01:44:45,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:45,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:45,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1790203267, now seen corresponding path program 1 times [2024-11-12 01:44:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832476938] [2024-11-12 01:44:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:45,069 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-12 01:44:45,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:45,070 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-12 01:44:45,071 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-12 01:44:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:45,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:44:45,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:45,430 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-12 01:44:45,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:44:45,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:45,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832476938] [2024-11-12 01:44:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832476938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:44:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947660186] [2024-11-12 01:44:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:45,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:44:45,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:45,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:44:45,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:44:45,438 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-12 01:44:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:45,486 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2024-11-12 01:44:45,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:44:45,487 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-12 01:44:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:45,491 INFO L225 Difference]: With dead ends: 290 [2024-11-12 01:44:45,491 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 01:44:45,492 INFO L434 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-12 01:44:45,495 INFO L435 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-12 01:44:45,495 INFO L436 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-12 01:44:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 01:44:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-12 01:44:45,516 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-12 01:44:45,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2024-11-12 01:44:45,518 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 246 [2024-11-12 01:44:45,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:45,519 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2024-11-12 01:44:45,519 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-12 01:44:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2024-11-12 01:44:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-12 01:44:45,525 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:45,525 INFO L218 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-12 01:44:45,538 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 (3)] Ended with exit code 0 [2024-11-12 01:44:45,726 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-12 01:44:45,727 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:45,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:45,727 INFO L85 PathProgramCache]: Analyzing trace with hash 2009057985, now seen corresponding path program 1 times [2024-11-12 01:44:45,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:45,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812117886] [2024-11-12 01:44:45,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:45,728 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-12 01:44:45,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:45,731 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-12 01:44:45,732 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-12 01:44:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:46,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 01:44:46,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:47,030 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-12 01:44:47,030 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:44:47,030 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:47,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812117886] [2024-11-12 01:44:47,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812117886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:47,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:47,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:44:47,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090384294] [2024-11-12 01:44:47,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:47,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:44:47,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:47,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:44:47,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:44:47,035 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-12 01:44:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:47,396 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2024-11-12 01:44:47,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:44:47,398 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-12 01:44:47,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:47,402 INFO L225 Difference]: With dead ends: 498 [2024-11-12 01:44:47,402 INFO L226 Difference]: Without dead ends: 321 [2024-11-12 01:44:47,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 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-12 01:44:47,404 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 133 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:47,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 600 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:44:47,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-12 01:44:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 287. [2024-11-12 01:44:47,453 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-12 01:44:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2024-11-12 01:44:47,457 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 246 [2024-11-12 01:44:47,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:47,459 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2024-11-12 01:44:47,461 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-12 01:44:47,461 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2024-11-12 01:44:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-12 01:44:47,464 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:47,464 INFO L218 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-12 01:44:47,475 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-12 01:44:47,664 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-12 01:44:47,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:47,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash -677652604, now seen corresponding path program 1 times [2024-11-12 01:44:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:47,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1081215291] [2024-11-12 01:44:47,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:47,667 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-12 01:44:47,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:47,669 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-12 01:44:47,670 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-12 01:44:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:47,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 01:44:47,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:48,212 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-12 01:44:48,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:44:48,457 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-12 01:44:48,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:48,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1081215291] [2024-11-12 01:44:48,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1081215291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:44:48,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 01:44:48,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-12 01:44:48,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387693768] [2024-11-12 01:44:48,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 01:44:48,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 01:44:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 01:44:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-12 01:44:48,459 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-12 01:44:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:48,880 INFO L93 Difference]: Finished difference Result 488 states and 775 transitions. [2024-11-12 01:44:48,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 01:44:48,882 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-12 01:44:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:48,885 INFO L225 Difference]: With dead ends: 488 [2024-11-12 01:44:48,885 INFO L226 Difference]: Without dead ends: 311 [2024-11-12 01:44:48,886 INFO L434 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-12 01:44:48,887 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 373 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:48,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 307 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 01:44:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-12 01:44:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2024-11-12 01:44:48,923 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-12 01:44:48,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions. [2024-11-12 01:44:48,926 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 247 [2024-11-12 01:44:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:48,928 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 472 transitions. [2024-11-12 01:44:48,928 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-12 01:44:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions. [2024-11-12 01:44:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-12 01:44:48,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:48,930 INFO L218 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-12 01:44:48,943 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 (5)] Forceful destruction successful, exit code 0 [2024-11-12 01:44:49,130 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-12 01:44:49,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:49,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:49,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1200151676, now seen corresponding path program 1 times [2024-11-12 01:44:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:49,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663100834] [2024-11-12 01:44:49,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:49,132 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-12 01:44:49,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:49,135 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-12 01:44:49,139 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-12 01:44:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:49,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 01:44:49,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:44:49,761 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-12 01:44:49,761 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:44:49,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:44:49,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663100834] [2024-11-12 01:44:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663100834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:44:49,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:44:49,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:44:49,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455569932] [2024-11-12 01:44:49,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:44:49,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 01:44:49,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:44:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 01:44:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 01:44:49,764 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-12 01:44:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:44:50,488 INFO L93 Difference]: Finished difference Result 492 states and 773 transitions. [2024-11-12 01:44:50,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 01:44:50,489 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-12 01:44:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:44:50,491 INFO L225 Difference]: With dead ends: 492 [2024-11-12 01:44:50,491 INFO L226 Difference]: Without dead ends: 307 [2024-11-12 01:44:50,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 245 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-12 01:44:50,493 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:44:50,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:44:50,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-12 01:44:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2024-11-12 01:44:50,530 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-12 01:44:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions. [2024-11-12 01:44:50,533 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 248 [2024-11-12 01:44:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:44:50,533 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 468 transitions. [2024-11-12 01:44:50,534 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-12 01:44:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions. [2024-11-12 01:44:50,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-12 01:44:50,536 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:44:50,536 INFO L218 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-12 01:44:50,549 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-12 01:44:50,736 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-12 01:44:50,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:44:50,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:44:50,738 INFO L85 PathProgramCache]: Analyzing trace with hash 122871261, now seen corresponding path program 1 times [2024-11-12 01:44:50,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:44:50,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236468765] [2024-11-12 01:44:50,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:44:50,739 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-12 01:44:50,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:44:50,740 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-12 01:44:50,741 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-12 01:44:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:44:50,990 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-12 01:44:50,995 INFO L279 TraceCheckSpWp]: Computing forward predicates...