./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-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-?-c7c6ca5-m [2024-11-09 02:15:54,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:15:54,632 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:15:54,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:15:54,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:15:54,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:15:54,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:15:54,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:15:54,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:15:54,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:15:54,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:15:54,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:15:54,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:15:54,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:15:54,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:15:54,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:15:54,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:15:54,674 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:15:54,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:15:54,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:15:54,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:15:54,679 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:15:54,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:15:54,680 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:15:54,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:15:54,680 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:15:54,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:15:54,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:15:54,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:15:54,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:15:54,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:15:54,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:15:54,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:54,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:15:54,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:15:54,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:15:54,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:15:54,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:15:54,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:15:54,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:15:54,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:15:54,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:15:54,685 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-09 02:15:54,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:15:54,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:15:54,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:15:54,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:15:54,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:15:55,001 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-09 02:15:56,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:15:56,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:15:56,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-09 02:15:56,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c3da2e8/7d8f8ad96f274be989e75ec5d206fdcf/FLAG1b4dd6b39 [2024-11-09 02:15:57,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c3da2e8/7d8f8ad96f274be989e75ec5d206fdcf [2024-11-09 02:15:57,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:15:57,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:15:57,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:57,085 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:15:57,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:15:57,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@392bbf90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57, skipping insertion in model container [2024-11-09 02:15:57,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:15:57,301 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-09 02:15:57,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:57,372 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:15:57,382 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-09 02:15:57,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:15:57,445 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:15:57,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57 WrapperNode [2024-11-09 02:15:57,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:15:57,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:57,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:15:57,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:15:57,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,528 INFO L138 Inliner]: procedures = 30, calls = 130, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-09 02:15:57,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:15:57,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:15:57,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:15:57,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:15:57,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,551 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,560 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:15:57,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:15:57,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:15:57,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:15:57,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:15:57,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (1/1) ... [2024-11-09 02:15:57,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:15:57,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:15:57,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 02:15:57,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 02:15:57,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:15:57,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:15:57,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:15:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:15:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:15:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:15:57,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:15:57,697 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:15:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:15:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:15:57,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:15:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:15:57,858 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:15:57,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:15:58,454 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-09 02:15:58,454 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:15:58,472 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:15:58,474 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:15:58,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:58 BoogieIcfgContainer [2024-11-09 02:15:58,475 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:15:58,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:15:58,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:15:58,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:15:58,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:15:57" (1/3) ... [2024-11-09 02:15:58,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6978da4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:58, skipping insertion in model container [2024-11-09 02:15:58,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:15:57" (2/3) ... [2024-11-09 02:15:58,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6978da4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:15:58, skipping insertion in model container [2024-11-09 02:15:58,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:15:58" (3/3) ... [2024-11-09 02:15:58,486 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-67.i [2024-11-09 02:15:58,502 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:15:58,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:15:58,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:15:58,566 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;@1efc9e8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:15:58,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:15:58,570 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-09 02:15:58,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:15:58,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:58,581 INFO L215 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-09 02:15:58,582 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:58,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 742144131, now seen corresponding path program 1 times [2024-11-09 02:15:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825870710] [2024-11-09 02:15:58,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,168 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-09 02:15:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:59,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825870710] [2024-11-09 02:15:59,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825870710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:59,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:59,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:15:59,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294104849] [2024-11-09 02:15:59,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:59,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:15:59,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:59,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:15:59,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:15:59,213 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-09 02:15:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:59,240 INFO L93 Difference]: Finished difference Result 179 states and 272 transitions. [2024-11-09 02:15:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:15:59,243 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-09 02:15:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:59,251 INFO L225 Difference]: With dead ends: 179 [2024-11-09 02:15:59,252 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 02:15:59,255 INFO L431 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-09 02:15:59,259 INFO L432 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-09 02:15:59,260 INFO L433 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-09 02:15:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 02:15:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 02:15:59,311 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-09 02:15:59,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-09 02:15:59,315 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 104 [2024-11-09 02:15:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:59,316 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-09 02:15:59,316 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-09 02:15:59,316 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-09 02:15:59,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:15:59,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:59,319 INFO L215 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-09 02:15:59,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:15:59,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:59,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:59,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1977666007, now seen corresponding path program 1 times [2024-11-09 02:15:59,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:59,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761803763] [2024-11-09 02:15:59,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:59,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:15:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:15:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:15:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:15:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:15:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:15:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:15:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:15:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:15:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:15:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:15:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:15:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:15:59,766 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-09 02:15:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:15:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761803763] [2024-11-09 02:15:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761803763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:15:59,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:15:59,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:15:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159828162] [2024-11-09 02:15:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:15:59,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:15:59,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:15:59,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:15:59,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:15:59,777 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-09 02:15:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:15:59,836 INFO L93 Difference]: Finished difference Result 178 states and 253 transitions. [2024-11-09 02:15:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:15:59,836 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-09 02:15:59,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:15:59,840 INFO L225 Difference]: With dead ends: 178 [2024-11-09 02:15:59,840 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 02:15:59,841 INFO L431 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-09 02:15:59,843 INFO L432 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-09 02:15:59,844 INFO L433 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-09 02:15:59,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 02:15:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-09 02:15:59,853 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-09 02:15:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2024-11-09 02:15:59,855 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 128 transitions. Word has length 104 [2024-11-09 02:15:59,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:15:59,857 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 128 transitions. [2024-11-09 02:15:59,857 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-09 02:15:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 128 transitions. [2024-11-09 02:15:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:15:59,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:15:59,859 INFO L215 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-09 02:15:59,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:15:59,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:15:59,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:15:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1637242919, now seen corresponding path program 1 times [2024-11-09 02:15:59,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:15:59,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863070492] [2024-11-09 02:15:59,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:15:59,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:15:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:16:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:16:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:16:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:16:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:16:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:16:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:16:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,251 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-09 02:16:00,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863070492] [2024-11-09 02:16:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863070492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:00,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:00,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:00,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102497930] [2024-11-09 02:16:00,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:00,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:00,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:00,257 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-09 02:16:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:00,298 INFO L93 Difference]: Finished difference Result 182 states and 257 transitions. [2024-11-09 02:16:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:00,303 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-09 02:16:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:00,304 INFO L225 Difference]: With dead ends: 182 [2024-11-09 02:16:00,304 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 02:16:00,305 INFO L431 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-09 02:16:00,306 INFO L432 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-09 02:16:00,310 INFO L433 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-09 02:16:00,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 02:16:00,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-09 02:16:00,323 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-09 02:16:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2024-11-09 02:16:00,327 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 104 [2024-11-09 02:16:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:00,327 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2024-11-09 02:16:00,328 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-09 02:16:00,328 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2024-11-09 02:16:00,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:16:00,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:00,331 INFO L215 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-09 02:16:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:16:00,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:00,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash 137764443, now seen corresponding path program 1 times [2024-11-09 02:16:00,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:00,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179613115] [2024-11-09 02:16:00,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:16:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:16:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:16:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:16:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:16:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:16:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:16:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:00,562 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-09 02:16:00,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:00,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179613115] [2024-11-09 02:16:00,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179613115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:00,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:00,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:16:00,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156172140] [2024-11-09 02:16:00,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:00,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:16:00,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:16:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:16:00,567 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-09 02:16:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:00,604 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-09 02:16:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:16:00,605 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-09 02:16:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:00,608 INFO L225 Difference]: With dead ends: 186 [2024-11-09 02:16:00,608 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 02:16:00,609 INFO L431 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-09 02:16:00,610 INFO L432 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-09 02:16:00,610 INFO L433 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-09 02:16:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 02:16:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-09 02:16:00,624 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-09 02:16:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2024-11-09 02:16:00,626 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 104 [2024-11-09 02:16:00,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2024-11-09 02:16:00,629 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-09 02:16:00,629 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2024-11-09 02:16:00,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:16:00,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:00,631 INFO L215 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-09 02:16:00,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:16:00,631 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:00,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:00,631 INFO L85 PathProgramCache]: Analyzing trace with hash 139611485, now seen corresponding path program 1 times [2024-11-09 02:16:00,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:00,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900514636] [2024-11-09 02:16:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:16:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:16:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:16:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:16:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:16:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:16:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:16:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:12,064 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-09 02:16:12,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:12,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900514636] [2024-11-09 02:16:12,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900514636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:16:12,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230591707] [2024-11-09 02:16:12,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:12,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:16:12,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:16:12,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:16:12,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:16:12,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:12,318 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-09 02:16:12,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:16:12,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 02:16:14,689 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-09 02:16:16,341 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-09 02:16:17,663 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-09 02:16:18,612 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-09 02:16:20,049 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-09 02:16:20,798 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-09 02:16:20,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:20,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:20,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:20,811 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-09 02:16:20,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:20,983 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-09 02:16:21,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:21,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:21,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:21,764 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-09 02:16:22,063 INFO L349 Elim1Store]: treesize reduction 39, result has 31.6 percent of original size [2024-11-09 02:16:22,063 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-09 02:16:22,174 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-09 02:16:22,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,314 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-09 02:16:22,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,405 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-09 02:16:22,405 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-09 02:16:22,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,702 INFO L349 Elim1Store]: treesize reduction 70, result has 20.5 percent of original size [2024-11-09 02:16:22,702 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-09 02:16:22,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,765 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-09 02:16:22,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:22,887 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-09 02:16:22,887 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-09 02:16:23,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,434 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-09 02:16:23,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,487 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 02:16:23,487 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-09 02:16:23,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,537 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-09 02:16:23,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,581 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-09 02:16:23,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:23,671 INFO L349 Elim1Store]: treesize reduction 126, result has 8.7 percent of original size [2024-11-09 02:16:23,671 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-09 02:16:24,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,064 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-09 02:16:24,295 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 02:16:24,334 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 02:16:24,357 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 02:16:24,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,675 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-09 02:16:24,676 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-09 02:16:24,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:16:24,993 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-09 02:16:25,057 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-09 02:16:25,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:16:25,679 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-09 02:16:26,157 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-09 02:16:28,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230591707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:16:28,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:16:28,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 29] total 47 [2024-11-09 02:16:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571333491] [2024-11-09 02:16:28,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:16:28,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-09 02:16:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:28,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-09 02:16:28,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=2297, Unknown=6, NotChecked=202, Total=2862 [2024-11-09 02:16:28,761 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-09 02:16:35,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:35,878 INFO L93 Difference]: Finished difference Result 373 states and 507 transitions. [2024-11-09 02:16:35,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-09 02:16:35,879 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-09 02:16:35,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:35,881 INFO L225 Difference]: With dead ends: 373 [2024-11-09 02:16:35,881 INFO L226 Difference]: Without dead ends: 281 [2024-11-09 02:16:35,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=915, Invalid=4939, Unknown=6, NotChecked=302, Total=6162 [2024-11-09 02:16:35,884 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1160 mSDsluCounter, 1993 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s 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.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:16:35,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1165 Valid, 2102 Invalid, 2652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 02:16:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-09 02:16:35,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 128. [2024-11-09 02:16:35,915 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-09 02:16:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 170 transitions. [2024-11-09 02:16:35,917 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 170 transitions. Word has length 104 [2024-11-09 02:16:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:35,918 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 170 transitions. [2024-11-09 02:16:35,919 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-09 02:16:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 170 transitions. [2024-11-09 02:16:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 02:16:35,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:35,922 INFO L215 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-09 02:16:35,942 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-09 02:16:36,126 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-09 02:16:36,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:36,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:36,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1665826849, now seen corresponding path program 1 times [2024-11-09 02:16:36,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:36,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894116687] [2024-11-09 02:16:36,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:36,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:16:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:16:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:16:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:16:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:16:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:16:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:16:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:16:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:16:36,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:16:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:16:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 02:16:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:16:36,236 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-09 02:16:36,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:16:36,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894116687] [2024-11-09 02:16:36,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894116687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:16:36,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:16:36,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:16:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258905602] [2024-11-09 02:16:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:16:36,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:16:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:16:36,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:16:36,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:16:36,240 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-09 02:16:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:16:36,303 INFO L93 Difference]: Finished difference Result 307 states and 411 transitions. [2024-11-09 02:16:36,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:16:36,303 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-09 02:16:36,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:16:36,305 INFO L225 Difference]: With dead ends: 307 [2024-11-09 02:16:36,305 INFO L226 Difference]: Without dead ends: 182 [2024-11-09 02:16:36,305 INFO L431 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-09 02:16:36,306 INFO L432 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-09 02:16:36,306 INFO L433 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-09 02:16:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-09 02:16:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 142. [2024-11-09 02:16:36,328 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-09 02:16:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 191 transitions. [2024-11-09 02:16:36,329 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 191 transitions. Word has length 104 [2024-11-09 02:16:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:16:36,330 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 191 transitions. [2024-11-09 02:16:36,330 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-09 02:16:36,330 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 191 transitions. [2024-11-09 02:16:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 02:16:36,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:16:36,332 INFO L215 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-09 02:16:36,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:16:36,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:16:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:16:36,333 INFO L85 PathProgramCache]: Analyzing trace with hash 58712133, now seen corresponding path program 1 times [2024-11-09 02:16:36,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:16:36,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720034151] [2024-11-09 02:16:36,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:16:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:16:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat