./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.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 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:18:55,640 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:18:55,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:18:55,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:18:55,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:18:55,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:18:55,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:18:55,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:18:55,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:18:55,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:18:55,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:18:55,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:18:55,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:18:55,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:18:55,783 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:18:55,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:18:55,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:18:55,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:18:55,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:18:55,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:18:55,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:18:55,785 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:18:55,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:18:55,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:18:55,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:18:55,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:18:55,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:18:55,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:18:55,787 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:18:55,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:18:55,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:18:55,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:18:55,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:55,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:18:55,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:18:55,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:18:55,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:18:55,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:18:55,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:18:55,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:18:55,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:18:55,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:18:55,793 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 -> 34a7e7e1117c68f092f781b8dcc8b7b6859e863c3fe77a01a5acd93b0a231d14 [2024-11-09 02:18:56,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:18:56,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:18:56,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:18:56,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:18:56,085 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:18:56,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-09 02:18:57,572 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:18:57,805 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:18:57,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-09 02:18:57,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcca37e2b/4721846839df407ea1f6976b4da09ffd/FLAG126d2d040 [2024-11-09 02:18:57,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcca37e2b/4721846839df407ea1f6976b4da09ffd [2024-11-09 02:18:57,838 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:18:57,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:18:57,843 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:57,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:18:57,848 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:18:57,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:57" (1/1) ... [2024-11-09 02:18:57,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eef371a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:57, skipping insertion in model container [2024-11-09 02:18:57,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:18:57" (1/1) ... [2024-11-09 02:18:57,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:18:58,070 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_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-11-09 02:18:58,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:58,166 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:18:58,182 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_variablewrapping_wrapper-sp_file-92.i[917,930] [2024-11-09 02:18:58,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:18:58,242 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:18:58,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58 WrapperNode [2024-11-09 02:18:58,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:18:58,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:58,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:18:58,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:18:58,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,265 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,321 INFO L138 Inliner]: procedures = 30, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 465 [2024-11-09 02:18:58,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:18:58,322 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:18:58,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:18:58,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:18:58,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,348 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:18:58,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,369 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,374 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,377 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:18:58,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:18:58,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:18:58,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:18:58,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (1/1) ... [2024-11-09 02:18:58,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:18:58,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:18:58,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:18:58,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:18:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:18:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:18:58,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:18:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:18:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:18:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:18:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:18:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:18:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:18:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:18:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:18:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:18:58,598 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:18:58,600 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:18:59,274 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-11-09 02:18:59,275 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:18:59,296 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:18:59,296 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:18:59,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:59 BoogieIcfgContainer [2024-11-09 02:18:59,296 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:18:59,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:18:59,301 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:18:59,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:18:59,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:18:57" (1/3) ... [2024-11-09 02:18:59,309 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660a9eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:59, skipping insertion in model container [2024-11-09 02:18:59,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:18:58" (2/3) ... [2024-11-09 02:18:59,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660a9eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:18:59, skipping insertion in model container [2024-11-09 02:18:59,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:18:59" (3/3) ... [2024-11-09 02:18:59,311 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-92.i [2024-11-09 02:18:59,329 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:18:59,330 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:18:59,401 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:18:59,409 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;@29928963, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:18:59,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:18:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:18:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:18:59,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:18:59,432 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:18:59,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:18:59,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:18:59,438 INFO L85 PathProgramCache]: Analyzing trace with hash 744802952, now seen corresponding path program 1 times [2024-11-09 02:18:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:18:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705299690] [2024-11-09 02:18:59,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:18:59,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:18:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:18:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:18:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:18:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:18:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:18:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:18:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:18:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:18:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:18:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:18:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:18:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:18:59,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:19:00,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:00,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705299690] [2024-11-09 02:19:00,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705299690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:00,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:00,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:19:00,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421075433] [2024-11-09 02:19:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:00,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:19:00,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:00,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:19:00,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:19:00,095 INFO L87 Difference]: Start difference. First operand has 113 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 92 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:19:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:00,134 INFO L93 Difference]: Finished difference Result 219 states and 339 transitions. [2024-11-09 02:19:00,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:19:00,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-09 02:19:00,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:00,144 INFO L225 Difference]: With dead ends: 219 [2024-11-09 02:19:00,144 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 02:19:00,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:19:00,153 INFO L432 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:00,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:19:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 02:19:00,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 02:19:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:19:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-09 02:19:00,199 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2024-11-09 02:19:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-09 02:19:00,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:19:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-09 02:19:00,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:19:00,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:00,204 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:00,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:19:00,205 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:00,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:00,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1760842982, now seen corresponding path program 1 times [2024-11-09 02:19:00,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:00,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158282424] [2024-11-09 02:19:00,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:00,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:00,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:19:00,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:00,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158282424] [2024-11-09 02:19:00,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158282424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:00,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:19:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834299265] [2024-11-09 02:19:00,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:00,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:19:00,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:00,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:19:00,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:19:00,714 INFO L87 Difference]: Start difference. First operand 109 states and 156 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:19:00,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:00,773 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2024-11-09 02:19:00,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:19:00,774 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2024-11-09 02:19:00,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:00,777 INFO L225 Difference]: With dead ends: 218 [2024-11-09 02:19:00,777 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 02:19:00,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:19:00,779 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:00,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:19:00,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 02:19:00,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-09 02:19:00,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:19:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2024-11-09 02:19:00,795 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2024-11-09 02:19:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:00,797 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2024-11-09 02:19:00,801 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-09 02:19:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2024-11-09 02:19:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:19:00,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:00,803 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:00,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:19:00,804 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:00,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1762690024, now seen corresponding path program 1 times [2024-11-09 02:19:00,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011668146] [2024-11-09 02:19:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:03,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:03,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-09 02:19:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011668146] [2024-11-09 02:19:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011668146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:19:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130605939] [2024-11-09 02:19:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:03,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:19:03,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:19:03,802 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-09 02:19:03,803 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-09 02:19:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:04,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 02:19:04,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:19:04,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:19:04,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:05,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:05,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:05,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:05,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:06,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:06,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:06,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:07,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:07,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:07,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:07,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:07,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 02:19:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 16 proven. 184 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2024-11-09 02:19:07,485 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:19:07,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130605939] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:19:07,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:19:07,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-09 02:19:07,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498802582] [2024-11-09 02:19:07,637 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:19:07,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:19:07,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:07,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:19:07,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-11-09 02:19:07,644 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 18 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-09 02:19:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:08,652 INFO L93 Difference]: Finished difference Result 227 states and 320 transitions. [2024-11-09 02:19:08,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:19:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) Word has length 153 [2024-11-09 02:19:08,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:08,658 INFO L225 Difference]: With dead ends: 227 [2024-11-09 02:19:08,660 INFO L226 Difference]: Without dead ends: 119 [2024-11-09 02:19:08,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=156, Invalid=444, Unknown=0, NotChecked=0, Total=600 [2024-11-09 02:19:08,662 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 136 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:08,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 600 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:19:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-09 02:19:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2024-11-09 02:19:08,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:19:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 160 transitions. [2024-11-09 02:19:08,687 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 160 transitions. Word has length 153 [2024-11-09 02:19:08,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:08,688 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 160 transitions. [2024-11-09 02:19:08,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.875) internal successors, (110), 18 states have internal predecessors, (110), 6 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (38), 4 states have call predecessors, (38), 6 states have call successors, (38) [2024-11-09 02:19:08,688 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 160 transitions. [2024-11-09 02:19:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:19:08,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:08,692 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:08,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:19:08,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:19:08,900 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:08,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:08,901 INFO L85 PathProgramCache]: Analyzing trace with hash -2109575446, now seen corresponding path program 1 times [2024-11-09 02:19:08,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:08,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225957996] [2024-11-09 02:19:08,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:08,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:17,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:18,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:18,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:18,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:18,158 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:19:18,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:18,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225957996] [2024-11-09 02:19:18,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225957996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:18,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:18,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:19:18,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447061990] [2024-11-09 02:19:18,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:18,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:19:18,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:19:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:19:18,163 INFO L87 Difference]: Start difference. First operand 115 states and 160 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:19:20,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:20,479 INFO L93 Difference]: Finished difference Result 283 states and 395 transitions. [2024-11-09 02:19:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:19:20,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-09 02:19:20,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:20,483 INFO L225 Difference]: With dead ends: 283 [2024-11-09 02:19:20,483 INFO L226 Difference]: Without dead ends: 171 [2024-11-09 02:19:20,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-09 02:19:20,485 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 433 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:20,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 493 Invalid, 619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 02:19:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-09 02:19:20,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 133. [2024-11-09 02:19:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.3243243243243243) internal successors, (147), 111 states have internal predecessors, (147), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-09 02:19:20,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-09 02:19:20,511 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 153 [2024-11-09 02:19:20,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:20,512 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-09 02:19:20,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:19:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-09 02:19:20,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:19:20,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:20,514 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:20,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:19:20,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:20,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash 905528172, now seen corresponding path program 1 times [2024-11-09 02:19:20,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:20,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992851472] [2024-11-09 02:19:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:20,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:25,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:25,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:19:25,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:25,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992851472] [2024-11-09 02:19:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992851472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 02:19:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040883925] [2024-11-09 02:19:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:25,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 02:19:25,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 02:19:25,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-09 02:19:25,617 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:19:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:27,009 INFO L93 Difference]: Finished difference Result 315 states and 434 transitions. [2024-11-09 02:19:27,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:19:27,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2024-11-09 02:19:27,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:27,012 INFO L225 Difference]: With dead ends: 315 [2024-11-09 02:19:27,012 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 02:19:27,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:19:27,013 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 276 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:27,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 528 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 02:19:27,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 02:19:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2024-11-09 02:19:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 152 states have (on average 1.3157894736842106) internal successors, (200), 153 states have internal predecessors, (200), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:19:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2024-11-09 02:19:27,069 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 153 [2024-11-09 02:19:27,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:27,069 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2024-11-09 02:19:27,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-09 02:19:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2024-11-09 02:19:27,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:19:27,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:27,072 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:27,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:19:27,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:27,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash -186347412, now seen corresponding path program 1 times [2024-11-09 02:19:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:27,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28840261] [2024-11-09 02:19:27,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:27,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:31,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:19:31,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:31,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28840261] [2024-11-09 02:19:31,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28840261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:31,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:31,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:19:31,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730132571] [2024-11-09 02:19:31,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:31,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:19:31,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:31,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:19:31,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:19:31,814 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:19:32,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:32,856 INFO L93 Difference]: Finished difference Result 413 states and 562 transitions. [2024-11-09 02:19:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:19:32,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2024-11-09 02:19:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:32,860 INFO L225 Difference]: With dead ends: 413 [2024-11-09 02:19:32,860 INFO L226 Difference]: Without dead ends: 236 [2024-11-09 02:19:32,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:19:32,861 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 410 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:32,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 402 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 02:19:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-09 02:19:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 184. [2024-11-09 02:19:32,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 156 states have (on average 1.314102564102564) internal successors, (205), 157 states have internal predecessors, (205), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:19:32,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 251 transitions. [2024-11-09 02:19:32,920 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 251 transitions. Word has length 153 [2024-11-09 02:19:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:32,921 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 251 transitions. [2024-11-09 02:19:32,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-09 02:19:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 251 transitions. [2024-11-09 02:19:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 02:19:32,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:32,923 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:32,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:19:32,924 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1466211090, now seen corresponding path program 1 times [2024-11-09 02:19:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705498192] [2024-11-09 02:19:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:42,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:42,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:42,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:42,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:42,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:42,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-09 02:19:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:43,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705498192] [2024-11-09 02:19:43,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705498192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:19:43,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:19:43,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 02:19:43,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255336920] [2024-11-09 02:19:43,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:19:43,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 02:19:43,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:19:43,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 02:19:43,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:19:43,464 INFO L87 Difference]: Start difference. First operand 184 states and 251 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 02:19:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:19:47,182 INFO L93 Difference]: Finished difference Result 403 states and 550 transitions. [2024-11-09 02:19:47,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:19:47,184 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) Word has length 153 [2024-11-09 02:19:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:19:47,186 INFO L225 Difference]: With dead ends: 403 [2024-11-09 02:19:47,186 INFO L226 Difference]: Without dead ends: 222 [2024-11-09 02:19:47,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2024-11-09 02:19:47,188 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 346 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 1353 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:19:47,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1064 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1353 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-09 02:19:47,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-09 02:19:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 182. [2024-11-09 02:19:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3116883116883118) internal successors, (202), 155 states have internal predecessors, (202), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 02:19:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 248 transitions. [2024-11-09 02:19:47,232 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 248 transitions. Word has length 153 [2024-11-09 02:19:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:19:47,232 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 248 transitions. [2024-11-09 02:19:47,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 18 states have internal predecessors, (61), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 5 states have call successors, (19) [2024-11-09 02:19:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 248 transitions. [2024-11-09 02:19:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-09 02:19:47,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:19:47,234 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:19:47,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:19:47,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:19:47,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:19:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1455171845, now seen corresponding path program 1 times [2024-11-09 02:19:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:19:47,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896918376] [2024-11-09 02:19:47,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:47,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:19:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:19:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:19:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:19:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:19:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:19:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:19:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:19:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:19:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:19:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:19:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 02:19:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:19:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:19:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:19:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:19:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:19:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:19:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:19:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 02:19:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-09 02:19:48,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:19:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896918376] [2024-11-09 02:19:48,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896918376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:19:48,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49310765] [2024-11-09 02:19:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:19:48,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:19:48,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:19:48,873 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:19:48,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:19:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:19:49,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-09 02:19:49,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:19:51,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:19:51,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:52,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:52,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:53,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:54,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:54,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 02:19:55,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:55,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:55,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:55,698 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-09 02:19:55,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 31 [2024-11-09 02:19:55,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:55,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:55,993 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-09 02:19:55,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2024-11-09 02:19:56,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2024-11-09 02:19:56,290 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 02:19:56,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 67 [2024-11-09 02:19:56,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2024-11-09 02:19:56,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 34 [2024-11-09 02:19:56,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,505 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2024-11-09 02:19:56,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 98 [2024-11-09 02:19:56,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:56,601 INFO L349 Elim1Store]: treesize reduction 64, result has 37.9 percent of original size [2024-11-09 02:19:56,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 98 [2024-11-09 02:19:57,184 INFO L349 Elim1Store]: treesize reduction 116, result has 37.3 percent of original size [2024-11-09 02:19:57,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 261 treesize of output 266 [2024-11-09 02:19:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,912 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 02:19:59,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 02:19:59,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:19:59,984 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 02:19:59,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 59 [2024-11-09 02:20:00,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,444 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 02:20:00,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 58 [2024-11-09 02:20:00,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,621 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 02:20:00,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2024-11-09 02:20:00,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,652 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-11-09 02:20:00,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2024-11-09 02:20:00,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:20:00,686 INFO L349 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2024-11-09 02:20:00,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2024-11-09 02:20:00,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 02:20:00,841 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 268 proven. 166 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-09 02:20:00,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:20:00,903 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1134 (Array Int Int))) (or (not (= (store (select |c_#memory_int| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1134)) (< (select (select (store |c_#memory_int| c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2))) is different from false [2024-11-09 02:20:00,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base))) (and (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (or (not (= (store (select .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)) v_ArrVal_1134)) (< (select (select (store .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))) (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_~WrapperStruct00_var_1_13_Pointer~0.base (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (or (not (= v_ArrVal_1134 (store (select .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< (select (select (store .cse2 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select |c_#memory_int| ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))) is different from false [2024-11-09 02:20:01,848 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base))) (and (forall ((v_ArrVal_1132 Int)) (let ((.cse1 (store |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1132)))) (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse0 (store .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse1 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 1)))) (or (not (= v_ArrVal_1134 (store (select .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< (select (select (store .cse0 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (not (= (mod (select (select .cse1 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0)))))) (forall ((v_ArrVal_1132 Int)) (let ((.cse4 (store |c_#memory_int| c_~WrapperStruct00_var_1_10_Pointer~0.base (store .cse2 c_~WrapperStruct00_var_1_10_Pointer~0.offset v_ArrVal_1132)))) (or (forall ((v_ArrVal_1134 (Array Int Int))) (let ((.cse3 (store .cse4 c_~WrapperStruct00_var_1_13_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset 0)))) (or (not (= v_ArrVal_1134 (store (select .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset (select v_ArrVal_1134 c_~WrapperStruct00_var_1_17_Pointer~0.offset)))) (< (select (select (store .cse3 c_~WrapperStruct00_var_1_17_Pointer~0.base v_ArrVal_1134) c_~WrapperStruct00_var_1_6_Pointer~0.base) c_~WrapperStruct00_var_1_6_Pointer~0.offset) 2)))) (forall ((~WrapperStruct00_var_1_15_Pointer~0.base Int) (~WrapperStruct00_var_1_15_Pointer~0.offset Int)) (= (mod (select (select .cse4 ~WrapperStruct00_var_1_15_Pointer~0.base) ~WrapperStruct00_var_1_15_Pointer~0.offset) 256) 0))))))) is different from false