./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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.dd.update-z3-fca748b-m [2024-11-20 02:57:54,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:57:54,946 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:57:54,950 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:57:54,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:57:54,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:57:54,976 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:57:54,976 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:57:54,977 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:57:54,978 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:57:54,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:57:54,979 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:57:54,979 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:57:54,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:57:54,980 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:57:54,981 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:57:54,981 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:57:54,982 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:57:54,982 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:57:54,983 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:57:54,983 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:57:54,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:57:54,984 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:57:54,985 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:57:54,985 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:57:54,985 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:57:54,985 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:57:54,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:57:54,986 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:57:54,986 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:57:54,986 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:57:54,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:57:54,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:57:54,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:57:54,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:57:54,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:57:54,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:57:54,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:57:54,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:57:54,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:57:54,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:57:54,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:57:54,989 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-20 02:57:55,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:57:55,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:57:55,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:57:55,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:57:55,256 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:57:55,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-20 02:57:56,510 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:57:56,715 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:57:56,715 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-20 02:57:56,724 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f4055ba/7bbc018cfeb5444baf986e417ca3f909/FLAGc0231eef1 [2024-11-20 02:57:56,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79f4055ba/7bbc018cfeb5444baf986e417ca3f909 [2024-11-20 02:57:56,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:57:56,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:57:56,742 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:57:56,742 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:57:56,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:57:56,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:57:56" (1/1) ... [2024-11-20 02:57:56,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faff980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:56, skipping insertion in model container [2024-11-20 02:57:56,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:57:56" (1/1) ... [2024-11-20 02:57:56,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:57:56,933 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-20 02:57:57,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:57:57,042 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:57:57,052 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-20 02:57:57,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:57:57,146 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:57:57,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57 WrapperNode [2024-11-20 02:57:57,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:57:57,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:57:57,149 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:57:57,149 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:57:57,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,166 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,206 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 318 [2024-11-20 02:57:57,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:57:57,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:57:57,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:57:57,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:57:57,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,223 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,241 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-20 02:57:57,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,259 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:57:57,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:57:57,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:57:57,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:57:57,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (1/1) ... [2024-11-20 02:57:57,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:57:57,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:57:57,295 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-20 02:57:57,298 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-20 02:57:57,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:57:57,336 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:57:57,336 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:57:57,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:57:57,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:57:57,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:57:57,409 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:57:57,412 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:57:57,882 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 02:57:57,883 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:57:57,901 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:57:57,901 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:57:57,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:57:57 BoogieIcfgContainer [2024-11-20 02:57:57,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:57:57,905 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:57:57,905 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:57:57,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:57:57,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:57:56" (1/3) ... [2024-11-20 02:57:57,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7403ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:57:57, skipping insertion in model container [2024-11-20 02:57:57,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:57:57" (2/3) ... [2024-11-20 02:57:57,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7403ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:57:57, skipping insertion in model container [2024-11-20 02:57:57,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:57:57" (3/3) ... [2024-11-20 02:57:57,910 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-20 02:57:57,925 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:57:57,925 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:57:57,980 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:57:57,988 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;@e26ec2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:57:57,989 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:57:57,993 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-20 02:57:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-20 02:57:58,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:58,010 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:57:58,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:58,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:58,015 INFO L85 PathProgramCache]: Analyzing trace with hash -444858248, now seen corresponding path program 1 times [2024-11-20 02:57:58,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:58,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406546076] [2024-11-20 02:57:58,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:58,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:57:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:57:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:57:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:57:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:57:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:57:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:57:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:57:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:57:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:57:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:57:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:57:58,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:57:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:57:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:57:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:57:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:57:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:57:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:57:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:57:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:57:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:57:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:57:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:57:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:57:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:57:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:57:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:57:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:57:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:57:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:57:58,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:57:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:57:58,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:57:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:57:58,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:57:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:57:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:57:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:57:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:58,696 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-20 02:57:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:57:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406546076] [2024-11-20 02:57:58,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406546076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:58,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:58,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:57:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048822336] [2024-11-20 02:57:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:58,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:57:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:57:58,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:57:58,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:57:58,729 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-20 02:57:58,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:58,800 INFO L93 Difference]: Finished difference Result 326 states and 616 transitions. [2024-11-20 02:57:58,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:57:58,806 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-20 02:57:58,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:58,817 INFO L225 Difference]: With dead ends: 326 [2024-11-20 02:57:58,817 INFO L226 Difference]: Without dead ends: 196 [2024-11-20 02:57:58,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:57:58,827 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 200 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:58,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 408 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:57:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-20 02:57:58,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 129. [2024-11-20 02:57:58,894 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-20 02:57:58,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 208 transitions. [2024-11-20 02:57:58,897 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 208 transitions. Word has length 250 [2024-11-20 02:57:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:58,899 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 208 transitions. [2024-11-20 02:57:58,899 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-20 02:57:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 208 transitions. [2024-11-20 02:57:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-20 02:57:58,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:58,906 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:57:58,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:57:58,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:58,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:58,908 INFO L85 PathProgramCache]: Analyzing trace with hash -659469682, now seen corresponding path program 1 times [2024-11-20 02:57:58,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:58,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871610877] [2024-11-20 02:57:58,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:58,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:57:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:57:59,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:57:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:57:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:57:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:57:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:57:59,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:57:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:57:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:57:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:57:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:57:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:57:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:57:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:57:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:57:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:57:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:57:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:57:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:57:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:57:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:57:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:57:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:57:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:57:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:57:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:57:59,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:57:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:57:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:57:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:57:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:57:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:57:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:57:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:57:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:57:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:57:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:57:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:57:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,338 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-20 02:57:59,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:57:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871610877] [2024-11-20 02:57:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871610877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:59,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:59,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:57:59,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288042391] [2024-11-20 02:57:59,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:59,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:57:59,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:57:59,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:57:59,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:57:59,346 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-20 02:57:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:59,621 INFO L93 Difference]: Finished difference Result 351 states and 567 transitions. [2024-11-20 02:57:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:57:59,625 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-20 02:57:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:59,630 INFO L225 Difference]: With dead ends: 351 [2024-11-20 02:57:59,630 INFO L226 Difference]: Without dead ends: 225 [2024-11-20 02:57:59,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:57:59,632 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 288 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:59,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 659 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:57:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-20 02:57:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 149. [2024-11-20 02:57:59,658 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-20 02:57:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 238 transitions. [2024-11-20 02:57:59,661 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 238 transitions. Word has length 251 [2024-11-20 02:57:59,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:59,663 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 238 transitions. [2024-11-20 02:57:59,664 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-20 02:57:59,664 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 238 transitions. [2024-11-20 02:57:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:57:59,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:59,669 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:57:59,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:57:59,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:59,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:59,669 INFO L85 PathProgramCache]: Analyzing trace with hash 713954525, now seen corresponding path program 1 times [2024-11-20 02:57:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:59,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304261825] [2024-11-20 02:57:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:57:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:57:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:57:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:57:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:57:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:57:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:57:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:57:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:57:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:57:59,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:57:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:57:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:57:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:57:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:57:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:57:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:57:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:57:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:57:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:57:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:57:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:57:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:57:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:57:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:57:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:57:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:57:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:57:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:57:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:57:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:57:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:57:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:57:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:57:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:57:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:57:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:57:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:57:59,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:57:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:57:59,911 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-20 02:57:59,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:57:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304261825] [2024-11-20 02:57:59,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304261825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:57:59,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:57:59,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:57:59,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997159351] [2024-11-20 02:57:59,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:57:59,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:57:59,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:57:59,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:57:59,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:57:59,913 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-20 02:57:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:57:59,936 INFO L93 Difference]: Finished difference Result 296 states and 475 transitions. [2024-11-20 02:57:59,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:57:59,937 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-20 02:57:59,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:57:59,940 INFO L225 Difference]: With dead ends: 296 [2024-11-20 02:57:59,940 INFO L226 Difference]: Without dead ends: 150 [2024-11-20 02:57:59,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:57:59,945 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 0 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:57:59,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 408 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:57:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-20 02:57:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-20 02:57:59,960 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-20 02:57:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 239 transitions. [2024-11-20 02:57:59,962 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 239 transitions. Word has length 252 [2024-11-20 02:57:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:57:59,963 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 239 transitions. [2024-11-20 02:57:59,963 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-20 02:57:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 239 transitions. [2024-11-20 02:57:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:57:59,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:57:59,966 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:57:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:57:59,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:57:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:57:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1280190181, now seen corresponding path program 1 times [2024-11-20 02:57:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:57:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667469173] [2024-11-20 02:57:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:57:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:57:59,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:00,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:00,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:00,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:00,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:00,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,146 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-20 02:58:00,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667469173] [2024-11-20 02:58:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667469173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:00,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:00,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:58:00,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196913072] [2024-11-20 02:58:00,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:00,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:58:00,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:00,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:58:00,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:58:00,149 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-20 02:58:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:00,186 INFO L93 Difference]: Finished difference Result 408 states and 651 transitions. [2024-11-20 02:58:00,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:58:00,187 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-20 02:58:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:00,190 INFO L225 Difference]: With dead ends: 408 [2024-11-20 02:58:00,190 INFO L226 Difference]: Without dead ends: 261 [2024-11-20 02:58:00,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:58:00,193 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 138 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:00,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 500 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:58:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-20 02:58:00,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2024-11-20 02:58:00,214 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-20 02:58:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 410 transitions. [2024-11-20 02:58:00,217 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 410 transitions. Word has length 252 [2024-11-20 02:58:00,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:00,217 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 410 transitions. [2024-11-20 02:58:00,218 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-20 02:58:00,218 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 410 transitions. [2024-11-20 02:58:00,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:58:00,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:00,220 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:00,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:58:00,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:00,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 643037853, now seen corresponding path program 1 times [2024-11-20 02:58:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190375120] [2024-11-20 02:58:00,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:00,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:00,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:00,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:00,526 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-20 02:58:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190375120] [2024-11-20 02:58:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190375120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:58:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231378335] [2024-11-20 02:58:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:58:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:58:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:58:00,530 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-20 02:58:00,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:00,762 INFO L93 Difference]: Finished difference Result 671 states and 1071 transitions. [2024-11-20 02:58:00,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:58:00,762 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-20 02:58:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:00,767 INFO L225 Difference]: With dead ends: 671 [2024-11-20 02:58:00,768 INFO L226 Difference]: Without dead ends: 416 [2024-11-20 02:58:00,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:58:00,769 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 335 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:00,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 635 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:58:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-20 02:58:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 260. [2024-11-20 02:58:00,796 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-20 02:58:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions. [2024-11-20 02:58:00,797 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252 [2024-11-20 02:58:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:00,799 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 414 transitions. [2024-11-20 02:58:00,799 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-20 02:58:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions. [2024-11-20 02:58:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:58:00,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:00,801 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:00,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:58:00,802 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:00,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1162400481, now seen corresponding path program 1 times [2024-11-20 02:58:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:00,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065356504] [2024-11-20 02:58:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:01,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:01,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:01,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:01,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:01,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:01,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,251 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-20 02:58:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065356504] [2024-11-20 02:58:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065356504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:58:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614399543] [2024-11-20 02:58:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:01,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:58:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:58:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:58:01,255 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-20 02:58:01,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:01,512 INFO L93 Difference]: Finished difference Result 723 states and 1151 transitions. [2024-11-20 02:58:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:58:01,512 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-20 02:58:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:01,516 INFO L225 Difference]: With dead ends: 723 [2024-11-20 02:58:01,516 INFO L226 Difference]: Without dead ends: 466 [2024-11-20 02:58:01,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:58:01,517 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 607 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:01,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 500 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:58:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-20 02:58:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 260. [2024-11-20 02:58:01,543 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-20 02:58:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 414 transitions. [2024-11-20 02:58:01,545 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 414 transitions. Word has length 252 [2024-11-20 02:58:01,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:01,546 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 414 transitions. [2024-11-20 02:58:01,546 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-20 02:58:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 414 transitions. [2024-11-20 02:58:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:58:01,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:01,549 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:01,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:58:01,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:01,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:01,550 INFO L85 PathProgramCache]: Analyzing trace with hash -703347101, now seen corresponding path program 1 times [2024-11-20 02:58:01,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:01,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111634625] [2024-11-20 02:58:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:01,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:01,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:01,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:01,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:01,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:01,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:01,891 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-20 02:58:01,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:01,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111634625] [2024-11-20 02:58:01,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111634625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:01,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:01,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:58:01,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225407192] [2024-11-20 02:58:01,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:01,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:58:01,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:01,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:58:01,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:58:01,893 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-20 02:58:02,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:02,776 INFO L93 Difference]: Finished difference Result 967 states and 1528 transitions. [2024-11-20 02:58:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:58:02,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-20 02:58:02,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:02,781 INFO L225 Difference]: With dead ends: 967 [2024-11-20 02:58:02,781 INFO L226 Difference]: Without dead ends: 710 [2024-11-20 02:58:02,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-20 02:58:02,783 INFO L432 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-20 02:58:02,783 INFO L433 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-20 02:58:02,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-20 02:58:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 484. [2024-11-20 02:58:02,847 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-20 02:58:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 765 transitions. [2024-11-20 02:58:02,850 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 765 transitions. Word has length 252 [2024-11-20 02:58:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:02,852 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 765 transitions. [2024-11-20 02:58:02,852 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-20 02:58:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 765 transitions. [2024-11-20 02:58:02,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:58:02,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:02,854 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:02,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:58:02,855 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:02,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:02,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1520995551, now seen corresponding path program 1 times [2024-11-20 02:58:02,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:02,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464408145] [2024-11-20 02:58:02,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:02,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:03,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:03,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,369 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-20 02:58:03,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:03,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464408145] [2024-11-20 02:58:03,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464408145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:03,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:03,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:58:03,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319201740] [2024-11-20 02:58:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:03,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:58:03,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:03,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:58:03,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:03,371 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-20 02:58:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:03,429 INFO L93 Difference]: Finished difference Result 1007 states and 1584 transitions. [2024-11-20 02:58:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:58:03,430 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-20 02:58:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:03,433 INFO L225 Difference]: With dead ends: 1007 [2024-11-20 02:58:03,433 INFO L226 Difference]: Without dead ends: 526 [2024-11-20 02:58:03,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:03,435 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 32 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:03,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 589 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:58:03,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-20 02:58:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 500. [2024-11-20 02:58:03,475 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-20 02:58:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 789 transitions. [2024-11-20 02:58:03,478 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 789 transitions. Word has length 252 [2024-11-20 02:58:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:03,479 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 789 transitions. [2024-11-20 02:58:03,479 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-20 02:58:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 789 transitions. [2024-11-20 02:58:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-20 02:58:03,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:03,481 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:58:03,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:03,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:03,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1519148509, now seen corresponding path program 1 times [2024-11-20 02:58:03,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:03,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809706109] [2024-11-20 02:58:03,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:03,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:03,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:03,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:03,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:03,928 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-20 02:58:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809706109] [2024-11-20 02:58:03,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809706109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:03,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:58:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554416545] [2024-11-20 02:58:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:03,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:58:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:58:03,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:03,931 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-20 02:58:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:04,180 INFO L93 Difference]: Finished difference Result 1328 states and 2105 transitions. [2024-11-20 02:58:04,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:58:04,181 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-20 02:58:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:04,186 INFO L225 Difference]: With dead ends: 1328 [2024-11-20 02:58:04,187 INFO L226 Difference]: Without dead ends: 831 [2024-11-20 02:58:04,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:58:04,189 INFO L432 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-20 02:58:04,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 724 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:58:04,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-20 02:58:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749. [2024-11-20 02:58:04,261 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-20 02:58:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1190 transitions. [2024-11-20 02:58:04,265 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1190 transitions. Word has length 252 [2024-11-20 02:58:04,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:04,266 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1190 transitions. [2024-11-20 02:58:04,266 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-20 02:58:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1190 transitions. [2024-11-20 02:58:04,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-20 02:58:04,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:04,268 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:04,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:58:04,269 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:04,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:04,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1561684595, now seen corresponding path program 1 times [2024-11-20 02:58:04,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:04,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915743537] [2024-11-20 02:58:04,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:04,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:05,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:05,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:05,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:05,429 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-20 02:58:05,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:05,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915743537] [2024-11-20 02:58:05,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915743537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:05,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:05,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 02:58:05,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808584398] [2024-11-20 02:58:05,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:05,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:58:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:58:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:58:05,431 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-20 02:58:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:06,857 INFO L93 Difference]: Finished difference Result 2531 states and 4015 transitions. [2024-11-20 02:58:06,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:58:06,857 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-20 02:58:06,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:06,869 INFO L225 Difference]: With dead ends: 2531 [2024-11-20 02:58:06,869 INFO L226 Difference]: Without dead ends: 1992 [2024-11-20 02:58:06,872 INFO L431 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-20 02:58:06,874 INFO L432 NwaCegarLoop]: 287 mSDtfsCounter, 982 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:06,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 776 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 02:58:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-20 02:58:07,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 795. [2024-11-20 02:58:07,023 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-20 02:58:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 1254 transitions. [2024-11-20 02:58:07,027 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 1254 transitions. Word has length 253 [2024-11-20 02:58:07,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:07,028 INFO L471 AbstractCegarLoop]: Abstraction has 795 states and 1254 transitions. [2024-11-20 02:58:07,028 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-20 02:58:07,028 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1254 transitions. [2024-11-20 02:58:07,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-20 02:58:07,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:07,030 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 02:58:07,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:07,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:07,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1702233205, now seen corresponding path program 1 times [2024-11-20 02:58:07,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535641587] [2024-11-20 02:58:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:07,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:07,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:07,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:07,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:07,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:07,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,175 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-20 02:58:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535641587] [2024-11-20 02:58:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535641587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:07,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:58:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616668635] [2024-11-20 02:58:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:07,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:58:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:07,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:58:07,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:58:07,177 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-20 02:58:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:07,418 INFO L93 Difference]: Finished difference Result 1532 states and 2415 transitions. [2024-11-20 02:58:07,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:58:07,418 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-20 02:58:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:07,424 INFO L225 Difference]: With dead ends: 1532 [2024-11-20 02:58:07,424 INFO L226 Difference]: Without dead ends: 941 [2024-11-20 02:58:07,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:07,427 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 140 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:07,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 754 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:58:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-20 02:58:07,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 781. [2024-11-20 02:58:07,557 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-20 02:58:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1228 transitions. [2024-11-20 02:58:07,565 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1228 transitions. Word has length 253 [2024-11-20 02:58:07,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:07,566 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1228 transitions. [2024-11-20 02:58:07,566 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-20 02:58:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1228 transitions. [2024-11-20 02:58:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-20 02:58:07,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:07,569 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:07,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 02:58:07,569 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:07,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1850281472, now seen corresponding path program 1 times [2024-11-20 02:58:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132808678] [2024-11-20 02:58:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:07,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:07,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:07,843 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-20 02:58:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132808678] [2024-11-20 02:58:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132808678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 02:58:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141096302] [2024-11-20 02:58:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 02:58:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:07,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 02:58:07,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:58:07,846 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-20 02:58:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:08,381 INFO L93 Difference]: Finished difference Result 1844 states and 2902 transitions. [2024-11-20 02:58:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 02:58:08,382 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-20 02:58:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:08,389 INFO L225 Difference]: With dead ends: 1844 [2024-11-20 02:58:08,389 INFO L226 Difference]: Without dead ends: 1517 [2024-11-20 02:58:08,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:58:08,392 INFO L432 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.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:08,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 729 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:58:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-20 02:58:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 809. [2024-11-20 02:58:08,504 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-20 02:58:08,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1272 transitions. [2024-11-20 02:58:08,509 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1272 transitions. Word has length 254 [2024-11-20 02:58:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:08,510 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1272 transitions. [2024-11-20 02:58:08,510 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-20 02:58:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1272 transitions. [2024-11-20 02:58:08,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-20 02:58:08,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:08,512 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:08,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 02:58:08,513 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:08,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1427579646, now seen corresponding path program 1 times [2024-11-20 02:58:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351871471] [2024-11-20 02:58:08,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:08,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:08,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:08,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:08,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:08,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:08,690 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-20 02:58:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:08,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351871471] [2024-11-20 02:58:08,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351871471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:58:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84542202] [2024-11-20 02:58:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:58:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:58:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:58:08,693 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-20 02:58:08,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:08,955 INFO L93 Difference]: Finished difference Result 1340 states and 2112 transitions. [2024-11-20 02:58:08,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:58:08,955 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-20 02:58:08,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:08,961 INFO L225 Difference]: With dead ends: 1340 [2024-11-20 02:58:08,961 INFO L226 Difference]: Without dead ends: 973 [2024-11-20 02:58:08,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:08,964 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 143 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:08,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 544 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:58:08,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2024-11-20 02:58:09,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 813. [2024-11-20 02:58:09,052 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-20 02:58:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1268 transitions. [2024-11-20 02:58:09,056 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1268 transitions. Word has length 254 [2024-11-20 02:58:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:09,056 INFO L471 AbstractCegarLoop]: Abstraction has 813 states and 1268 transitions. [2024-11-20 02:58:09,056 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-20 02:58:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1268 transitions. [2024-11-20 02:58:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-20 02:58:09,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:09,059 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 02:58:09,059 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:09,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1287031036, now seen corresponding path program 1 times [2024-11-20 02:58:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127859308] [2024-11-20 02:58:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:09,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,313 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-20 02:58:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127859308] [2024-11-20 02:58:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127859308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:09,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:09,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:58:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438612155] [2024-11-20 02:58:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:09,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:58:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:09,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:58:09,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:09,315 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-20 02:58:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:09,711 INFO L93 Difference]: Finished difference Result 1296 states and 2032 transitions. [2024-11-20 02:58:09,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:58:09,711 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-20 02:58:09,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:09,716 INFO L225 Difference]: With dead ends: 1296 [2024-11-20 02:58:09,717 INFO L226 Difference]: Without dead ends: 909 [2024-11-20 02:58:09,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:58:09,718 INFO L432 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-20 02:58:09,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 928 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:58:09,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2024-11-20 02:58:09,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 755. [2024-11-20 02:58:09,798 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-20 02:58:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1176 transitions. [2024-11-20 02:58:09,802 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1176 transitions. Word has length 254 [2024-11-20 02:58:09,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:09,803 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1176 transitions. [2024-11-20 02:58:09,803 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-20 02:58:09,803 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1176 transitions. [2024-11-20 02:58:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-20 02:58:09,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:09,805 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:09,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 02:58:09,806 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:09,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1538630839, now seen corresponding path program 1 times [2024-11-20 02:58:09,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:09,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49523244] [2024-11-20 02:58:09,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:09,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:09,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:10,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:10,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,043 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-20 02:58:10,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:10,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49523244] [2024-11-20 02:58:10,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49523244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:10,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:10,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:58:10,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411544085] [2024-11-20 02:58:10,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:10,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:58:10,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:10,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:58:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:58:10,045 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-20 02:58:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:10,260 INFO L93 Difference]: Finished difference Result 1750 states and 2749 transitions. [2024-11-20 02:58:10,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:58:10,261 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-20 02:58:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:10,267 INFO L225 Difference]: With dead ends: 1750 [2024-11-20 02:58:10,267 INFO L226 Difference]: Without dead ends: 1155 [2024-11-20 02:58:10,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:10,271 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 121 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:10,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 663 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:58:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2024-11-20 02:58:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 747. [2024-11-20 02:58:10,360 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-20 02:58:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1158 transitions. [2024-11-20 02:58:10,364 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1158 transitions. Word has length 254 [2024-11-20 02:58:10,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:10,364 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1158 transitions. [2024-11-20 02:58:10,364 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-20 02:58:10,364 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1158 transitions. [2024-11-20 02:58:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-20 02:58:10,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:10,366 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:10,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 02:58:10,367 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:10,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash -246445727, now seen corresponding path program 1 times [2024-11-20 02:58:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683203921] [2024-11-20 02:58:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:10,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:10,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:10,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:10,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:10,591 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-20 02:58:10,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:10,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683203921] [2024-11-20 02:58:10,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683203921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:10,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:10,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:58:10,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558817684] [2024-11-20 02:58:10,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:10,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:58:10,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:58:10,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:58:10,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:10,594 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-20 02:58:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:10,948 INFO L93 Difference]: Finished difference Result 1541 states and 2388 transitions. [2024-11-20 02:58:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:58:10,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-20 02:58:10,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:10,954 INFO L225 Difference]: With dead ends: 1541 [2024-11-20 02:58:10,954 INFO L226 Difference]: Without dead ends: 994 [2024-11-20 02:58:10,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:58:10,956 INFO L432 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-20 02:58:10,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 639 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:58:10,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-11-20 02:58:11,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 988. [2024-11-20 02:58:11,055 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-20 02:58:11,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1529 transitions. [2024-11-20 02:58:11,060 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1529 transitions. Word has length 254 [2024-11-20 02:58:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:11,061 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1529 transitions. [2024-11-20 02:58:11,061 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-20 02:58:11,061 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1529 transitions. [2024-11-20 02:58:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-20 02:58:11,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:11,064 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:11,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 02:58:11,065 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 176256099, now seen corresponding path program 1 times [2024-11-20 02:58:11,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:58:11,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861030422] [2024-11-20 02:58:11,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:58:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:58:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:58:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:58:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:58:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:58:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:58:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:58:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:58:11,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 02:58:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:58:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 02:58:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:58:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 02:58:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:58:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 02:58:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:58:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:58:11,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 02:58:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 02:58:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 02:58:11,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 02:58:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:58:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 02:58:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:58:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-20 02:58:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 02:58:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 02:58:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 02:58:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 02:58:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 02:58:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-20 02:58:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-20 02:58:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-20 02:58:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-20 02:58:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-20 02:58:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-20 02:58:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-11-20 02:58:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2024-11-20 02:58:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-20 02:58:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,614 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-20 02:58:11,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:58:11,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861030422] [2024-11-20 02:58:11,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861030422] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:58:11,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101697209] [2024-11-20 02:58:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:11,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:58:11,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:58:11,618 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-20 02:58:11,620 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-20 02:58:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:11,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 02:58:11,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:58:12,295 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-20 02:58:12,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:58:12,406 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-20 02:58:12,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:58:12,607 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-20 02:58:12,609 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: Modulus must be strictly greater one but is 0 at de.uni_freiburg.informatik.ultimate.util.ArithmeticUtils.multiplicativeInverse(ArithmeticUtils.java:89) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.findAllDmlPossibilities(DualJunctionDml.java:162) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionDml.tryToEliminate(DualJunctionDml.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:542) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:521) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:514) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:325) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-20 02:58:12,615 INFO L158 Benchmark]: Toolchain (without parser) took 15874.98ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 100.2MB in the beginning and 549.5MB in the end (delta: -449.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:58:12,615 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 104.9MB. Free memory was 76.3MB in the beginning and 76.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:58:12,615 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.65ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 136.4MB in the end (delta: -36.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-20 02:58:12,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.35ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 132.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:58:12,617 INFO L158 Benchmark]: Boogie Preprocessor took 52.38ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 127.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:58:12,617 INFO L158 Benchmark]: RCFGBuilder took 638.50ms. Allocated memory is still 167.8MB. Free memory was 127.2MB in the beginning and 92.3MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-20 02:58:12,617 INFO L158 Benchmark]: TraceAbstraction took 14709.93ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 91.6MB in the beginning and 549.5MB in the end (delta: -457.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:58:12,619 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.13ms. Allocated memory is still 104.9MB. Free memory was 76.3MB in the beginning and 76.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.65ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 136.4MB in the end (delta: -36.4MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.35ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 132.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.38ms. Allocated memory is still 167.8MB. Free memory was 132.2MB in the beginning and 127.2MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 638.50ms. Allocated memory is still 167.8MB. Free memory was 127.2MB in the beginning and 92.3MB in the end (delta: 35.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14709.93ms. Allocated memory was 167.8MB in the beginning and 595.6MB in the end (delta: 427.8MB). Free memory was 91.6MB in the beginning and 549.5MB in the end (delta: -457.9MB). There was no memory consumed. 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-20 02:58:12,647 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_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.dd.update-z3-fca748b-m [2024-11-20 02:58:14,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:58:14,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:58:14,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:58:14,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:58:14,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:58:14,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:58:14,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:58:14,728 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:58:14,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:58:14,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:58:14,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:58:14,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:58:14,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:58:14,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:58:14,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:58:14,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:58:14,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:58:14,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:58:14,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:58:14,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:58:14,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:58:14,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:58:14,733 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:58:14,734 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:58:14,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:58:14,734 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:58:14,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:58:14,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:58:14,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:58:14,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:58:14,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:58:14,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:58:14,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:58:14,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:58:14,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:58:14,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:58:14,736 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:58:14,737 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:58:14,737 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:58:14,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:58:14,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:58:14,737 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:58:14,737 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:58:14,738 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-20 02:58:15,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:58:15,040 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:58:15,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:58:15,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:58:15,044 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:58:15,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-20 02:58:16,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:58:16,546 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:58:16,547 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-20 02:58:16,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b05c6c3d/bb58497633ca49a9b15e9792a4c70da2/FLAG90d7a6315 [2024-11-20 02:58:16,568 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b05c6c3d/bb58497633ca49a9b15e9792a4c70da2 [2024-11-20 02:58:16,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:58:16,571 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:58:16,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:58:16,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:58:16,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:58:16,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:16,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c59138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16, skipping insertion in model container [2024-11-20 02:58:16,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:16,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:58:16,771 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-20 02:58:16,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:58:16,891 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:58:16,904 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-20 02:58:16,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:58:16,989 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:58:16,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16 WrapperNode [2024-11-20 02:58:16,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:58:16,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:58:16,991 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:58:16,991 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:58:16,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,048 INFO L138 Inliner]: procedures = 27, calls = 52, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 253 [2024-11-20 02:58:17,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:58:17,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:58:17,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:58:17,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:58:17,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,073 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,093 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-20 02:58:17,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:58:17,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:58:17,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:58:17,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:58:17,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (1/1) ... [2024-11-20 02:58:17,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:58:17,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:58:17,164 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-20 02:58:17,167 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-20 02:58:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:58:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:58:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:58:17,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:58:17,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:58:17,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:58:17,284 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:58:17,287 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:58:18,053 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 02:58:18,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:58:18,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:58:18,070 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:58:18,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:58:18 BoogieIcfgContainer [2024-11-20 02:58:18,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:58:18,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:58:18,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:58:18,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:58:18,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:58:16" (1/3) ... [2024-11-20 02:58:18,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6acea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:58:18, skipping insertion in model container [2024-11-20 02:58:18,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:58:16" (2/3) ... [2024-11-20 02:58:18,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6acea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:58:18, skipping insertion in model container [2024-11-20 02:58:18,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:58:18" (3/3) ... [2024-11-20 02:58:18,081 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-11.i [2024-11-20 02:58:18,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:58:18,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:58:18,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:58:18,164 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;@3a0d9e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:58:18,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:58:18,169 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-20 02:58:18,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-20 02:58:18,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:18,181 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:18,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:18,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:18,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1081086981, now seen corresponding path program 1 times [2024-11-20 02:58:18,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:58:18,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196003141] [2024-11-20 02:58:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:18,203 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-20 02:58:18,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:58:18,205 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-20 02:58:18,225 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-20 02:58:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:18,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:58:18,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:58:18,692 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-20 02:58:18,695 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:58:18,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:58:18,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196003141] [2024-11-20 02:58:18,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196003141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:18,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:18,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:58:18,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177256881] [2024-11-20 02:58:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:18,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:58:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:58:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:58:18,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:58:18,735 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-20 02:58:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:18,771 INFO L93 Difference]: Finished difference Result 221 states and 405 transitions. [2024-11-20 02:58:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:58:18,775 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-20 02:58:18,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:18,781 INFO L225 Difference]: With dead ends: 221 [2024-11-20 02:58:18,782 INFO L226 Difference]: Without dead ends: 110 [2024-11-20 02:58:18,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:58:18,788 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:18,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:58:18,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-20 02:58:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-20 02:58:18,828 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-20 02:58:18,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 177 transitions. [2024-11-20 02:58:18,832 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 177 transitions. Word has length 246 [2024-11-20 02:58:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:18,832 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 177 transitions. [2024-11-20 02:58:18,833 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-20 02:58:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 177 transitions. [2024-11-20 02:58:18,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-20 02:58:18,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:18,839 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:18,853 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-20 02:58:19,040 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-20 02:58:19,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:19,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1790203267, now seen corresponding path program 1 times [2024-11-20 02:58:19,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:58:19,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1751075141] [2024-11-20 02:58:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:19,042 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-20 02:58:19,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:58:19,045 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-20 02:58:19,054 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-20 02:58:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:19,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:58:19,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:58:19,449 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-20 02:58:19,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:58:19,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:58:19,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1751075141] [2024-11-20 02:58:19,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1751075141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:19,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:19,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:58:19,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376196612] [2024-11-20 02:58:19,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:19,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:58:19,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:58:19,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:58:19,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:58:19,457 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-20 02:58:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:19,527 INFO L93 Difference]: Finished difference Result 290 states and 469 transitions. [2024-11-20 02:58:19,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:58:19,528 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-20 02:58:19,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:19,539 INFO L225 Difference]: With dead ends: 290 [2024-11-20 02:58:19,539 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 02:58:19,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:58:19,543 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 112 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:19,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 432 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:58:19,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 02:58:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2024-11-20 02:58:19,578 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-20 02:58:19,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2024-11-20 02:58:19,582 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 246 [2024-11-20 02:58:19,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:19,583 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2024-11-20 02:58:19,584 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-20 02:58:19,584 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2024-11-20 02:58:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-20 02:58:19,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:19,594 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:19,608 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-20 02:58:19,795 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-20 02:58:19,796 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:19,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:19,797 INFO L85 PathProgramCache]: Analyzing trace with hash 2009057985, now seen corresponding path program 1 times [2024-11-20 02:58:19,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:58:19,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [134525240] [2024-11-20 02:58:19,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:19,798 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-20 02:58:19,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:58:19,801 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-20 02:58:19,802 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-20 02:58:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:20,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 02:58:20,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:58:21,294 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-20 02:58:21,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:58:21,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:58:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [134525240] [2024-11-20 02:58:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [134525240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:21,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:21,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:58:21,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844895459] [2024-11-20 02:58:21,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:58:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:58:21,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:58:21,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:58:21,306 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-20 02:58:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:21,757 INFO L93 Difference]: Finished difference Result 498 states and 807 transitions. [2024-11-20 02:58:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:58:21,759 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-20 02:58:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:21,765 INFO L225 Difference]: With dead ends: 498 [2024-11-20 02:58:21,765 INFO L226 Difference]: Without dead ends: 321 [2024-11-20 02:58:21,769 INFO L431 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-20 02:58:21,770 INFO L432 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.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:21,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 600 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:58:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-20 02:58:21,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 287. [2024-11-20 02:58:21,820 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-20 02:58:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2024-11-20 02:58:21,823 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 246 [2024-11-20 02:58:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:21,824 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2024-11-20 02:58:21,824 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-20 02:58:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2024-11-20 02:58:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-20 02:58:21,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:21,826 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:21,840 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-20 02:58:22,027 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-20 02:58:22,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:22,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:22,028 INFO L85 PathProgramCache]: Analyzing trace with hash -677652604, now seen corresponding path program 1 times [2024-11-20 02:58:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:58:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917553727] [2024-11-20 02:58:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:22,040 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-20 02:58:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:58:22,043 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-20 02:58:22,044 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-20 02:58:22,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:22,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 02:58:22,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:58:22,734 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-20 02:58:22,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:58:23,011 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-20 02:58:23,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:58:23,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917553727] [2024-11-20 02:58:23,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917553727] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:58:23,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:58:23,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-20 02:58:23,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464967064] [2024-11-20 02:58:23,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:58:23,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:58:23,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:58:23,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:58:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:58:23,016 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-20 02:58:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:23,514 INFO L93 Difference]: Finished difference Result 488 states and 775 transitions. [2024-11-20 02:58:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 02:58:23,516 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-20 02:58:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:23,521 INFO L225 Difference]: With dead ends: 488 [2024-11-20 02:58:23,521 INFO L226 Difference]: Without dead ends: 311 [2024-11-20 02:58:23,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-20 02:58:23,526 INFO L432 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.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:23,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 307 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:58:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-20 02:58:23,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 299. [2024-11-20 02:58:23,568 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-20 02:58:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions. [2024-11-20 02:58:23,571 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 247 [2024-11-20 02:58:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:23,573 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 472 transitions. [2024-11-20 02:58:23,574 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-20 02:58:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions. [2024-11-20 02:58:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-20 02:58:23,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:23,578 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:23,594 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-20 02:58:23,779 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-20 02:58:23,779 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:23,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1200151676, now seen corresponding path program 1 times [2024-11-20 02:58:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:58:23,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696934750] [2024-11-20 02:58:23,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:23,781 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-20 02:58:23,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:58:23,783 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-20 02:58:23,785 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-20 02:58:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:24,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 02:58:24,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:58:24,503 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-20 02:58:24,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:58:24,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:58:24,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696934750] [2024-11-20 02:58:24,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696934750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:58:24,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:58:24,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:58:24,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858647886] [2024-11-20 02:58:24,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:58:24,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:58:24,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:58:24,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:58:24,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:58:24,506 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-20 02:58:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:58:25,546 INFO L93 Difference]: Finished difference Result 492 states and 773 transitions. [2024-11-20 02:58:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:58:25,548 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-20 02:58:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:58:25,550 INFO L225 Difference]: With dead ends: 492 [2024-11-20 02:58:25,550 INFO L226 Difference]: Without dead ends: 307 [2024-11-20 02:58:25,551 INFO L431 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-20 02:58:25,552 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 139 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:58:25,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 436 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 02:58:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-20 02:58:25,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 299. [2024-11-20 02:58:25,594 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-20 02:58:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 468 transitions. [2024-11-20 02:58:25,597 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 468 transitions. Word has length 248 [2024-11-20 02:58:25,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:58:25,597 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 468 transitions. [2024-11-20 02:58:25,598 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-20 02:58:25,598 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 468 transitions. [2024-11-20 02:58:25,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-20 02:58:25,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:58:25,601 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:58:25,617 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-20 02:58:25,801 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-20 02:58:25,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:58:25,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:58:25,802 INFO L85 PathProgramCache]: Analyzing trace with hash 122871261, now seen corresponding path program 1 times [2024-11-20 02:58:25,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:58:25,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228905888] [2024-11-20 02:58:25,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:58:25,803 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-20 02:58:25,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:58:25,804 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-20 02:58:25,805 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-20 02:58:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:58:26,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 02:58:26,136 INFO L278 TraceCheckSpWp]: Computing forward predicates...