./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.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 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 07:54:39,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 07:54:39,845 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 07:54:39,849 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 07:54:39,850 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 07:54:39,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 07:54:39,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 07:54:39,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 07:54:39,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 07:54:39,881 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 07:54:39,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 07:54:39,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 07:54:39,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 07:54:39,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 07:54:39,884 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 07:54:39,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 07:54:39,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 07:54:39,885 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 07:54:39,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 07:54:39,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 07:54:39,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 07:54:39,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 07:54:39,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 07:54:39,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 07:54:39,891 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 07:54:39,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 07:54:39,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 07:54:39,892 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 07:54:39,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 07:54:39,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 07:54:39,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 07:54:39,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 07:54:39,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:54:39,893 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 07:54:39,893 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 07:54:39,894 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 07:54:39,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 07:54:39,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 07:54:39,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 07:54:39,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 07:54:39,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 07:54:39,897 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 07:54:39,897 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 -> 2bfc3a2327f8b20a29fd925460a8337c18b9a784fffca7c1ea577a58172303bb [2024-11-12 07:54:40,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 07:54:40,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 07:54:40,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 07:54:40,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 07:54:40,209 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 07:54:40,210 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-67.i [2024-11-12 07:54:41,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 07:54:42,005 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 07:54:42,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-12 07:54:42,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02dc3cd5b/05815f82789b405793df513339560f04/FLAGfdc640a39 [2024-11-12 07:54:42,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02dc3cd5b/05815f82789b405793df513339560f04 [2024-11-12 07:54:42,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 07:54:42,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 07:54:42,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 07:54:42,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 07:54:42,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 07:54:42,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a40384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42, skipping insertion in model container [2024-11-12 07:54:42,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 07:54:42,597 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-67.i[917,930] [2024-11-12 07:54:42,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:54:42,671 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 07:54:42,681 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-67.i[917,930] [2024-11-12 07:54:42,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 07:54:42,741 INFO L204 MainTranslator]: Completed translation [2024-11-12 07:54:42,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42 WrapperNode [2024-11-12 07:54:42,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 07:54:42,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 07:54:42,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 07:54:42,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 07:54:42,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,806 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-12 07:54:42,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 07:54:42,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 07:54:42,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 07:54:42,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 07:54:42,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,825 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,836 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-12 07:54:42,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,857 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 07:54:42,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 07:54:42,866 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 07:54:42,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 07:54:42,867 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (1/1) ... [2024-11-12 07:54:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 07:54:42,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:54:42,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 07:54:42,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 07:54:42,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 07:54:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-12 07:54:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-12 07:54:42,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-12 07:54:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 07:54:42,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-12 07:54:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 07:54:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 07:54:42,964 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 07:54:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 07:54:42,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 07:54:42,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 07:54:43,095 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 07:54:43,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 07:54:43,727 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-12 07:54:43,727 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 07:54:43,746 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 07:54:43,747 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 07:54:43,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:54:43 BoogieIcfgContainer [2024-11-12 07:54:43,747 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 07:54:43,751 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 07:54:43,751 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 07:54:43,754 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 07:54:43,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 07:54:42" (1/3) ... [2024-11-12 07:54:43,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c133a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:54:43, skipping insertion in model container [2024-11-12 07:54:43,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 07:54:42" (2/3) ... [2024-11-12 07:54:43,755 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c133a2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 07:54:43, skipping insertion in model container [2024-11-12 07:54:43,755 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 07:54:43" (3/3) ... [2024-11-12 07:54:43,757 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-12 07:54:43,773 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 07:54:43,774 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 07:54:43,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 07:54:43,844 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;@46cbbd55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 07:54:43,845 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 07:54:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:54:43,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:54:43,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:54:43,858 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:54:43,859 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:54:43,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:54:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 742144131, now seen corresponding path program 1 times [2024-11-12 07:54:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:54:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956097628] [2024-11-12 07:54:43,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:54:43,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:54:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:54:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:54:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:54:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:54:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:54:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:54:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:54:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:54:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:54:44,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:54:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:54:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:54:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,355 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:54:44,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:54:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956097628] [2024-11-12 07:54:44,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956097628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:54:44,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:54:44,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 07:54:44,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022794832] [2024-11-12 07:54:44,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:54:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 07:54:44,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:54:44,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 07:54:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:54:44,405 INFO L87 Difference]: Start difference. First operand has 93 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 79 states have internal predecessors, (109), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:54:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:54:44,442 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-12 07:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 07:54:44,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-12 07:54:44,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:54:44,453 INFO L225 Difference]: With dead ends: 179 [2024-11-12 07:54:44,453 INFO L226 Difference]: Without dead ends: 89 [2024-11-12 07:54:44,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 07:54:44,458 INFO L435 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:54:44,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:54:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-12 07:54:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-12 07:54:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 75 states have (on average 1.36) internal successors, (102), 75 states have internal predecessors, (102), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:54:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-12 07:54:44,506 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-12 07:54:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:54:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-12 07:54:44,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-12 07:54:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-12 07:54:44,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:54:44,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:54:44,510 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:54:44,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 07:54:44,510 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:54:44,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:54:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1977666007, now seen corresponding path program 1 times [2024-11-12 07:54:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:54:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64854108] [2024-11-12 07:54:44,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:54:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:54:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:54:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:54:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:54:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:54:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:54:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:54:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:54:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:54:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:54:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:54:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:54:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:54:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:54:44,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:54:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64854108] [2024-11-12 07:54:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64854108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:54:44,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:54:44,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:54:44,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529803038] [2024-11-12 07:54:44,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:54:44,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:54:44,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:54:44,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:54:44,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:54:44,938 INFO L87 Difference]: Start difference. First operand 89 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:54:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:54:44,987 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-11-12 07:54:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:54:44,988 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-12 07:54:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:54:44,990 INFO L225 Difference]: With dead ends: 178 [2024-11-12 07:54:44,990 INFO L226 Difference]: Without dead ends: 92 [2024-11-12 07:54:44,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-12 07:54:44,992 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:54:44,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 358 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:54:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-12 07:54:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-12 07:54:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 77 states have internal predecessors, (104), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:54:45,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-12 07:54:45,008 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-11-12 07:54:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:54:45,013 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-12 07:54:45,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:54:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-12 07:54:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:54:45,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:54:45,018 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:54:45,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 07:54:45,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:54:45,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:54:45,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1637242919, now seen corresponding path program 1 times [2024-11-12 07:54:45,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:54:45,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405008956] [2024-11-12 07:54:45,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:54:45,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:54:45,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:54:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:54:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:54:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:54:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:54:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:54:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:54:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:54:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:54:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:54:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:54:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:54:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:54:45,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:54:45,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405008956] [2024-11-12 07:54:45,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405008956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:54:45,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:54:45,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:54:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737824159] [2024-11-12 07:54:45,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:54:45,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:54:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:54:45,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:54:45,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:54:45,303 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:54:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:54:45,331 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-12 07:54:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:54:45,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-12 07:54:45,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:54:45,333 INFO L225 Difference]: With dead ends: 182 [2024-11-12 07:54:45,334 INFO L226 Difference]: Without dead ends: 94 [2024-11-12 07:54:45,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-12 07:54:45,336 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:54:45,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 359 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:54:45,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-12 07:54:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-12 07:54:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.3417721518987342) internal successors, (106), 79 states have internal predecessors, (106), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:54:45,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-12 07:54:45,351 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-11-12 07:54:45,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:54:45,352 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-12 07:54:45,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:54:45,352 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-12 07:54:45,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:54:45,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:54:45,354 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:54:45,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 07:54:45,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:54:45,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:54:45,358 INFO L85 PathProgramCache]: Analyzing trace with hash 137764443, now seen corresponding path program 1 times [2024-11-12 07:54:45,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:54:45,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560808472] [2024-11-12 07:54:45,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:54:45,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:54:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:54:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:54:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:54:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:54:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:54:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:54:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:54:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:54:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:54:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:54:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:54:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:54:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:54:45,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:54:45,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560808472] [2024-11-12 07:54:45,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560808472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:54:45,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:54:45,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 07:54:45,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475760556] [2024-11-12 07:54:45,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:54:45,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 07:54:45,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:54:45,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 07:54:45,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 07:54:45,629 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:54:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:54:45,670 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-12 07:54:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 07:54:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-12 07:54:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:54:45,674 INFO L225 Difference]: With dead ends: 186 [2024-11-12 07:54:45,675 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 07:54:45,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-12 07:54:45,677 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 1 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:54:45,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 361 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:54:45,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 07:54:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-12 07:54:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 81 states have internal predecessors, (108), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:54:45,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-12 07:54:45,690 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-11-12 07:54:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:54:45,693 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-12 07:54:45,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:54:45,693 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-12 07:54:45,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:54:45,695 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:54:45,695 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:54:45,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 07:54:45,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:54:45,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:54:45,696 INFO L85 PathProgramCache]: Analyzing trace with hash 139611485, now seen corresponding path program 1 times [2024-11-12 07:54:45,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:54:45,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229471982] [2024-11-12 07:54:45,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:54:45,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:54:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:54:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:54:56,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:54:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:54:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:54:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:54:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:54:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:54:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:54:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:54:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:54:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:54:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,734 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-12 07:54:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:54:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229471982] [2024-11-12 07:54:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229471982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:54:56,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128635586] [2024-11-12 07:54:56,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:54:56,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:54:56,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 07:54:56,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 07:54:56,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 07:54:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:54:56,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-12 07:54:57,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 07:54:57,412 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-12 07:54:59,222 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 32 treesize of output 16 [2024-11-12 07:55:00,659 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 48 treesize of output 31 [2024-11-12 07:55:01,572 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 48 treesize of output 31 [2024-11-12 07:55:02,318 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 48 treesize of output 31 [2024-11-12 07:55:03,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2024-11-12 07:55:04,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 193 treesize of output 139 [2024-11-12 07:55:04,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:04,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:04,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 139 [2024-11-12 07:55:04,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:04,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 72 treesize of output 55 [2024-11-12 07:55:05,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 104 [2024-11-12 07:55:05,523 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2024-11-12 07:55:05,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 184 treesize of output 171 [2024-11-12 07:55:05,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 37 [2024-11-12 07:55:05,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 58 [2024-11-12 07:55:05,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:05,828 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-12 07:55:05,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 109 treesize of output 210 [2024-11-12 07:55:06,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,120 INFO L349 Elim1Store]: treesize reduction 70, result has 20.5 percent of original size [2024-11-12 07:55:06,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 167 treesize of output 154 [2024-11-12 07:55:06,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 54 [2024-11-12 07:55:06,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,319 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-12 07:55:06,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 125 treesize of output 222 [2024-11-12 07:55:06,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 74 [2024-11-12 07:55:06,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,917 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-12 07:55:06,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 72 [2024-11-12 07:55:06,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 70 [2024-11-12 07:55:06,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:06,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 68 [2024-11-12 07:55:07,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,085 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-12 07:55:07,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 7 case distinctions, treesize of input 121 treesize of output 220 [2024-11-12 07:55:07,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:07,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2024-11-12 07:55:07,784 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-12 07:55:07,832 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-12 07:55:07,853 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-12 07:55:08,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,149 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-12 07:55:08,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 110 [2024-11-12 07:55:08,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 07:55:08,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 275 treesize of output 135 [2024-11-12 07:55:08,533 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-12 07:55:08,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 07:55:09,135 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base))) (and (forall ((v_ArrVal_524 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)) v_ArrVal_524)) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse4 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse1 (mod (+ (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse1 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) (< 32767 .cse1))))) (not (= v_ArrVal_525 (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset))))))))) (forall ((v_ArrVal_524 (Array Int Int))) (or (not (= (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)) v_ArrVal_524)) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse7 (let ((.cse8 (let ((.cse9 (store .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse9 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse9 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse9 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse6 (mod (+ (select (select .cse7 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse7 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse6 (+ 65536 (select (select .cse7 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset))) (< .cse6 32768))))) (not (= v_ArrVal_525 (store (select .cse10 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset))))))))))) is different from false [2024-11-12 07:55:09,585 WARN L851 $PredicateComparison]: unable to prove that (or (< |c_ULTIMATE.start_step_~stepLocal_0~0#1| |c_ULTIMATE.start_step_#t~mem7#1|) (let ((.cse6 (select |c_#memory_int| c_~WrapperStruct00_var_1_6_Pointer~0.base))) (and (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 Int)) (let ((.cse0 (store |c_#memory_int| c_~WrapperStruct00_var_1_6_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_523)))) (or (not (= v_ArrVal_524 (store (select .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse5 (store .cse0 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse4 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse4 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse1 (mod (+ (select (select .cse2 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse2 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (< 32767 .cse1) (= .cse1 (select (select .cse2 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset)))))) (not (= v_ArrVal_525 (store (select .cse5 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))))))))) (forall ((v_ArrVal_524 (Array Int Int)) (v_ArrVal_523 Int)) (let ((.cse7 (store |c_#memory_int| c_~WrapperStruct00_var_1_6_Pointer~0.base (store .cse6 c_~WrapperStruct00_var_1_6_Pointer~0.offset v_ArrVal_523)))) (or (not (= v_ArrVal_524 (store (select .cse7 c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset (select v_ArrVal_524 c_~WrapperStruct00_var_1_11_Pointer~0.offset)))) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse12 (store .cse7 c_~WrapperStruct00_var_1_11_Pointer~0.base v_ArrVal_524))) (or (forall ((~WrapperStruct00_var_1_7_Pointer~0.offset Int) (v_ArrVal_527 Int) (~WrapperStruct00_var_1_7_Pointer~0.base Int)) (let ((.cse9 (let ((.cse10 (let ((.cse11 (store .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base v_ArrVal_525))) (store .cse11 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse11 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset (select (select .cse11 ~WrapperStruct00_var_1_7_Pointer~0.base) ~WrapperStruct00_var_1_7_Pointer~0.offset)))))) (store .cse10 c_~WrapperStruct00_var_1_8_Pointer~0.base (store (select .cse10 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset v_ArrVal_527))))) (let ((.cse8 (mod (+ (select (select .cse9 c_~WrapperStruct00_var_1_4_Pointer~0.base) c_~WrapperStruct00_var_1_4_Pointer~0.offset) (select (select .cse9 c_~WrapperStruct00_var_1_5_Pointer~0.base) c_~WrapperStruct00_var_1_5_Pointer~0.offset)) 65536))) (or (= .cse8 (+ (select (select .cse9 c_~WrapperStruct00_var_1_1_Pointer~0.base) c_~WrapperStruct00_var_1_1_Pointer~0.offset) 65536)) (< .cse8 32768))))) (not (= v_ArrVal_525 (store (select .cse12 c_~WrapperStruct00_var_1_13_Pointer~0.base) c_~WrapperStruct00_var_1_13_Pointer~0.offset (select v_ArrVal_525 c_~WrapperStruct00_var_1_13_Pointer~0.offset)))))))))))) (and (not (= |c_ULTIMATE.start_step_#t~mem8#1| 0)) (not (= |c_ULTIMATE.start_step_#t~mem7#1| 0)))) is different from false [2024-11-12 07:55:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128635586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 07:55:12,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 07:55:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2024-11-12 07:55:12,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560457636] [2024-11-12 07:55:12,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 07:55:12,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-12 07:55:12,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:12,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-12 07:55:12,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2297, Unknown=6, NotChecked=202, Total=2862 [2024-11-12 07:55:12,297 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 47 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 42 states have internal predecessors, (102), 12 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-12 07:55:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:19,092 INFO L93 Difference]: Finished difference Result 373 states and 507 transitions. [2024-11-12 07:55:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-12 07:55:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 42 states have internal predecessors, (102), 12 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) Word has length 104 [2024-11-12 07:55:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:19,096 INFO L225 Difference]: With dead ends: 373 [2024-11-12 07:55:19,096 INFO L226 Difference]: Without dead ends: 281 [2024-11-12 07:55:19,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=915, Invalid=4939, Unknown=6, NotChecked=302, Total=6162 [2024-11-12 07:55:19,101 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 1160 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1165 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 2652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:19,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 2102 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-12 07:55:19,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-12 07:55:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 128. [2024-11-12 07:55:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 110 states have (on average 1.3272727272727274) internal successors, (146), 110 states have internal predecessors, (146), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:55:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 170 transitions. [2024-11-12 07:55:19,132 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 170 transitions. Word has length 104 [2024-11-12 07:55:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:19,133 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 170 transitions. [2024-11-12 07:55:19,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 2.4878048780487805) internal successors, (102), 42 states have internal predecessors, (102), 12 states have call successors, (24), 6 states have call predecessors, (24), 9 states have return successors, (24), 10 states have call predecessors, (24), 12 states have call successors, (24) [2024-11-12 07:55:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 170 transitions. [2024-11-12 07:55:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-12 07:55:19,138 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:19,138 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:55:19,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 07:55:19,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 07:55:19,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:19,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1665826849, now seen corresponding path program 1 times [2024-11-12 07:55:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:19,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191631629] [2024-11-12 07:55:19,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:19,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 07:55:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-12 07:55:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-12 07:55:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 07:55:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 07:55:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-12 07:55:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 07:55:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 07:55:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 07:55:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 07:55:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 07:55:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-12 07:55:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 07:55:19,432 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-12 07:55:19,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 07:55:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191631629] [2024-11-12 07:55:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191631629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 07:55:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 07:55:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 07:55:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648628145] [2024-11-12 07:55:19,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 07:55:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 07:55:19,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 07:55:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 07:55:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:55:19,434 INFO L87 Difference]: Start difference. First operand 128 states and 170 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:55:19,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 07:55:19,492 INFO L93 Difference]: Finished difference Result 307 states and 411 transitions. [2024-11-12 07:55:19,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 07:55:19,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2024-11-12 07:55:19,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 07:55:19,494 INFO L225 Difference]: With dead ends: 307 [2024-11-12 07:55:19,494 INFO L226 Difference]: Without dead ends: 182 [2024-11-12 07:55:19,495 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 07:55:19,495 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 61 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 07:55:19,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 07:55:19,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-12 07:55:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2024-11-12 07:55:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.346774193548387) internal successors, (167), 124 states have internal predecessors, (167), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-12 07:55:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2024-11-12 07:55:19,521 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 104 [2024-11-12 07:55:19,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 07:55:19,522 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2024-11-12 07:55:19,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-12 07:55:19,522 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2024-11-12 07:55:19,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 07:55:19,523 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 07:55:19,523 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 07:55:19,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 07:55:19,524 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 07:55:19,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 07:55:19,524 INFO L85 PathProgramCache]: Analyzing trace with hash 58712133, now seen corresponding path program 1 times [2024-11-12 07:55:19,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 07:55:19,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428319949] [2024-11-12 07:55:19,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 07:55:19,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 07:55:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat