./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c -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 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:39:10,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:39:10,809 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:39:10,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:39:10,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:39:10,834 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:39:10,835 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:39:10,835 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:39:10,836 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:39:10,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:39:10,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:39:10,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:39:10,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:39:10,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:39:10,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:39:10,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:39:10,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:39:10,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:39:10,840 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:39:10,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:39:10,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:39:10,841 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:39:10,843 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:39:10,843 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:39:10,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:39:10,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:39:10,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:39:10,844 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:39:10,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:39:10,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:39:10,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:39:10,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:39:10,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:39:10,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:39:10,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:39:10,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:39:10,847 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 -> 0d29c75fd5928e2fd79a32667a60cd8af89d36d3bace71f12987f1807282a833 [2024-11-19 20:39:11,046 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:39:11,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:39:11,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:39:11,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:39:11,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:39:11,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-19 20:39:12,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:39:12,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:39:12,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-sendmoremoney.c [2024-11-19 20:39:12,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be06c048/dedecc545bbb4a97a4d7ded56686df9c/FLAGce1f3b176 [2024-11-19 20:39:12,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7be06c048/dedecc545bbb4a97a4d7ded56686df9c [2024-11-19 20:39:12,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:39:12,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:39:12,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:39:12,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:39:12,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:39:12,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fef5da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12, skipping insertion in model container [2024-11-19 20:39:12,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:39:12,706 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/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-19 20:39:12,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:39:12,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:39:12,740 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/floats-nonlinear/color-sendmoremoney.c[614,627] [2024-11-19 20:39:12,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:39:12,769 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:39:12,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12 WrapperNode [2024-11-19 20:39:12,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:39:12,770 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:39:12,770 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:39:12,771 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:39:12,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,805 INFO L138 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 202 [2024-11-19 20:39:12,806 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:39:12,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:39:12,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:39:12,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:39:12,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,834 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-19 20:39:12,834 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,840 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,844 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:39:12,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:39:12,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:39:12,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:39:12,850 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (1/1) ... [2024-11-19 20:39:12,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:39:12,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:12,885 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-19 20:39:12,888 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-19 20:39:12,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:39:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_0 [2024-11-19 20:39:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_0 [2024-11-19 20:39:12,932 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain_1 [2024-11-19 20:39:12,932 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain_1 [2024-11-19 20:39:12,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:39:13,009 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:39:13,011 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:39:13,266 INFO L? ?]: Removed 78 outVars from TransFormulas that were not future-live. [2024-11-19 20:39:13,268 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:39:13,278 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:39:13,279 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 20:39:13,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:39:13 BoogieIcfgContainer [2024-11-19 20:39:13,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:39:13,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:39:13,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:39:13,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:39:13,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:39:12" (1/3) ... [2024-11-19 20:39:13,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9532bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:39:13, skipping insertion in model container [2024-11-19 20:39:13,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:12" (2/3) ... [2024-11-19 20:39:13,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e9532bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:39:13, skipping insertion in model container [2024-11-19 20:39:13,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:39:13" (3/3) ... [2024-11-19 20:39:13,290 INFO L112 eAbstractionObserver]: Analyzing ICFG color-sendmoremoney.c [2024-11-19 20:39:13,304 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:39:13,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:39:13,348 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:39:13,353 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;@6889d93b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:39:13,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:39:13,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:39:13,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:13,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-19 20:39:13,367 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:13,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -871385011, now seen corresponding path program 1 times [2024-11-19 20:39:13,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:13,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940826033] [2024-11-19 20:39:13,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:13,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:13,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:13,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:39:13,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:13,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940826033] [2024-11-19 20:39:13,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940826033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:13,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:13,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:39:13,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229839229] [2024-11-19 20:39:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:13,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:39:13,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:13,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:39:13,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:39:13,768 INFO L87 Difference]: Start difference. First operand has 58 states, 46 states have (on average 1.391304347826087) internal successors, (64), 47 states have internal predecessors, (64), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:13,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:13,821 INFO L93 Difference]: Finished difference Result 113 states and 156 transitions. [2024-11-19 20:39:13,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:39:13,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-19 20:39:13,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:13,830 INFO L225 Difference]: With dead ends: 113 [2024-11-19 20:39:13,830 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:39:13,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:39:13,834 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 0 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:13,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:39:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 20:39:13,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 78 transitions. [2024-11-19 20:39:13,867 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 78 transitions. Word has length 27 [2024-11-19 20:39:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:13,867 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 78 transitions. [2024-11-19 20:39:13,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:13,867 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 78 transitions. [2024-11-19 20:39:13,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:39:13,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:13,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-19 20:39:13,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:39:13,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:13,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:13,869 INFO L85 PathProgramCache]: Analyzing trace with hash 373379470, now seen corresponding path program 1 times [2024-11-19 20:39:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069438065] [2024-11-19 20:39:13,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:39:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069438065] [2024-11-19 20:39:14,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069438065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536911899] [2024-11-19 20:39:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,018 INFO L87 Difference]: Start difference. First operand 58 states and 78 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,041 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2024-11-19 20:39:14,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-19 20:39:14,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,045 INFO L225 Difference]: With dead ends: 62 [2024-11-19 20:39:14,045 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:39:14,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-19 20:39:14,047 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:39:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 20:39:14,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2024-11-19 20:39:14,056 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 27 [2024-11-19 20:39:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,056 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2024-11-19 20:39:14,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2024-11-19 20:39:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:39:14,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,058 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 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-19 20:39:14,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:39:14,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,058 INFO L85 PathProgramCache]: Analyzing trace with hash 373319888, now seen corresponding path program 1 times [2024-11-19 20:39:14,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529460519] [2024-11-19 20:39:14,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:39:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529460519] [2024-11-19 20:39:14,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529460519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:39:14,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037838651] [2024-11-19 20:39:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:39:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:39:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:39:14,107 INFO L87 Difference]: Start difference. First operand 58 states and 77 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,130 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-19 20:39:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:39:14,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2024-11-19 20:39:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,132 INFO L225 Difference]: With dead ends: 63 [2024-11-19 20:39:14,132 INFO L226 Difference]: Without dead ends: 58 [2024-11-19 20:39:14,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-19 20:39:14,133 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-19 20:39:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-19 20:39:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 46 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2024-11-19 20:39:14,141 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 27 [2024-11-19 20:39:14,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,142 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2024-11-19 20:39:14,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2024-11-19 20:39:14,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 20:39:14,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-19 20:39:14,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:39:14,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,145 INFO L85 PathProgramCache]: Analyzing trace with hash 489413935, now seen corresponding path program 1 times [2024-11-19 20:39:14,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115656477] [2024-11-19 20:39:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:39:14,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115656477] [2024-11-19 20:39:14,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115656477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:39:14,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981580110] [2024-11-19 20:39:14,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:39:14,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:39:14,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:39:14,226 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,254 INFO L93 Difference]: Finished difference Result 72 states and 92 transitions. [2024-11-19 20:39:14,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:39:14,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2024-11-19 20:39:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,258 INFO L225 Difference]: With dead ends: 72 [2024-11-19 20:39:14,258 INFO L226 Difference]: Without dead ends: 65 [2024-11-19 20:39:14,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-19 20:39:14,259 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-19 20:39:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2024-11-19 20:39:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 77 transitions. [2024-11-19 20:39:14,265 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 77 transitions. Word has length 30 [2024-11-19 20:39:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,266 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 77 transitions. [2024-11-19 20:39:14,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 77 transitions. [2024-11-19 20:39:14,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 20:39:14,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 20:39:14,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1188806749, now seen corresponding path program 1 times [2024-11-19 20:39:14,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562001293] [2024-11-19 20:39:14,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:39:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562001293] [2024-11-19 20:39:14,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562001293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276961629] [2024-11-19 20:39:14,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,366 INFO L87 Difference]: Start difference. First operand 59 states and 77 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,408 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2024-11-19 20:39:14,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2024-11-19 20:39:14,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,410 INFO L225 Difference]: With dead ends: 75 [2024-11-19 20:39:14,410 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:14,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-19 20:39:14,412 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:14,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 20:39:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2024-11-19 20:39:14,417 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 31 [2024-11-19 20:39:14,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,417 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2024-11-19 20:39:14,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 20:39:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2024-11-19 20:39:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:39:14,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,419 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:39:14,419 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -123550359, now seen corresponding path program 1 times [2024-11-19 20:39:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743465852] [2024-11-19 20:39:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 20:39:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:39:14,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743465852] [2024-11-19 20:39:14,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743465852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304520905] [2024-11-19 20:39:14,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,490 INFO L87 Difference]: Start difference. First operand 59 states and 76 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:39:14,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,513 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2024-11-19 20:39:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-11-19 20:39:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,515 INFO L225 Difference]: With dead ends: 83 [2024-11-19 20:39:14,516 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:14,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-19 20:39:14,518 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:14,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 20:39:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 states have internal predecessors, (57), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 75 transitions. [2024-11-19 20:39:14,528 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 75 transitions. Word has length 37 [2024-11-19 20:39:14,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,528 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 75 transitions. [2024-11-19 20:39:14,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 20:39:14,529 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 75 transitions. [2024-11-19 20:39:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 20:39:14,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,532 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 20:39:14,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1299194838, now seen corresponding path program 1 times [2024-11-19 20:39:14,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838849912] [2024-11-19 20:39:14,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:39:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 20:39:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 20:39:14,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838849912] [2024-11-19 20:39:14,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838849912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532805156] [2024-11-19 20:39:14,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,606 INFO L87 Difference]: Start difference. First operand 59 states and 75 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:39:14,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,630 INFO L93 Difference]: Finished difference Result 87 states and 107 transitions. [2024-11-19 20:39:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2024-11-19 20:39:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,636 INFO L225 Difference]: With dead ends: 87 [2024-11-19 20:39:14,636 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:14,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-19 20:39:14,637 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 191 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 20:39:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2024-11-19 20:39:14,645 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 43 [2024-11-19 20:39:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,645 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2024-11-19 20:39:14,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 20:39:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2024-11-19 20:39:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:39:14,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,648 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 20:39:14,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,648 INFO L85 PathProgramCache]: Analyzing trace with hash 318580198, now seen corresponding path program 1 times [2024-11-19 20:39:14,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509022042] [2024-11-19 20:39:14,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-19 20:39:14,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509022042] [2024-11-19 20:39:14,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509022042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852729959] [2024-11-19 20:39:14,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,718 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:39:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,736 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2024-11-19 20:39:14,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2024-11-19 20:39:14,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,737 INFO L225 Difference]: With dead ends: 91 [2024-11-19 20:39:14,737 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:14,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-19 20:39:14,742 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:14,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 20:39:14,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2024-11-19 20:39:14,748 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 73 transitions. Word has length 49 [2024-11-19 20:39:14,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,748 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 73 transitions. [2024-11-19 20:39:14,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 20:39:14,748 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2024-11-19 20:39:14,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-19 20:39:14,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 20:39:14,751 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1113083677, now seen corresponding path program 1 times [2024-11-19 20:39:14,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453853933] [2024-11-19 20:39:14,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-19 20:39:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-19 20:39:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 20:39:14,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 20:39:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:39:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453853933] [2024-11-19 20:39:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453853933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952616505] [2024-11-19 20:39:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,826 INFO L87 Difference]: Start difference. First operand 59 states and 73 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 20:39:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,846 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2024-11-19 20:39:14,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2024-11-19 20:39:14,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,847 INFO L225 Difference]: With dead ends: 101 [2024-11-19 20:39:14,847 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:14,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 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-19 20:39:14,848 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 0 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:14,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 20:39:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2024-11-19 20:39:14,852 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 55 [2024-11-19 20:39:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,852 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2024-11-19 20:39:14,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-19 20:39:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2024-11-19 20:39:14,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-19 20:39:14,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,853 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 20:39:14,853 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1508263573, now seen corresponding path program 1 times [2024-11-19 20:39:14,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164821040] [2024-11-19 20:39:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:39:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 20:39:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 20:39:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 20:39:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 20:39:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 20:39:14,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:14,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164821040] [2024-11-19 20:39:14,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164821040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:14,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:14,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:14,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897474793] [2024-11-19 20:39:14,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:14,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:14,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:14,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:14,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:14,924 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 20:39:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:14,942 INFO L93 Difference]: Finished difference Result 105 states and 125 transitions. [2024-11-19 20:39:14,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:14,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 61 [2024-11-19 20:39:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:14,943 INFO L225 Difference]: With dead ends: 105 [2024-11-19 20:39:14,943 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:14,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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-19 20:39:14,944 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:14,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-19 20:39:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 8 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 20:39:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-11-19 20:39:14,951 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 61 [2024-11-19 20:39:14,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:14,952 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-11-19 20:39:14,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-19 20:39:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-11-19 20:39:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 20:39:14,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:14,952 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:14,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 20:39:14,953 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:14,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:14,953 INFO L85 PathProgramCache]: Analyzing trace with hash 92534082, now seen corresponding path program 1 times [2024-11-19 20:39:14,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:14,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875884492] [2024-11-19 20:39:14,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:14,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:14,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 20:39:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:39:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 20:39:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 20:39:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 20:39:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 20:39:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,025 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 20:39:15,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:15,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875884492] [2024-11-19 20:39:15,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875884492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:15,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:15,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:15,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024704387] [2024-11-19 20:39:15,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:15,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:15,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:15,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:15,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:15,029 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 20:39:15,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:15,057 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2024-11-19 20:39:15,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:15,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-19 20:39:15,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:15,058 INFO L225 Difference]: With dead ends: 109 [2024-11-19 20:39:15,058 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 20:39:15,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-19 20:39:15,059 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:15,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 20:39:15,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2024-11-19 20:39:15,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:15,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-11-19 20:39:15,065 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 67 [2024-11-19 20:39:15,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:15,066 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-19 20:39:15,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-19 20:39:15,066 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-11-19 20:39:15,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 20:39:15,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:15,066 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:15,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 20:39:15,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1352872087, now seen corresponding path program 1 times [2024-11-19 20:39:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056678244] [2024-11-19 20:39:15,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 20:39:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:15,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056678244] [2024-11-19 20:39:15,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056678244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:15,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:15,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261090292] [2024-11-19 20:39:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:15,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:15,151 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:15,168 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2024-11-19 20:39:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 73 [2024-11-19 20:39:15,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:15,169 INFO L225 Difference]: With dead ends: 61 [2024-11-19 20:39:15,170 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 20:39:15,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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-19 20:39:15,170 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:15,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:15,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 20:39:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 20:39:15,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-19 20:39:15,176 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 73 [2024-11-19 20:39:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:15,177 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-19 20:39:15,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:15,178 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-19 20:39:15,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 20:39:15,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:15,179 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:15,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 20:39:15,179 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:15,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:15,180 INFO L85 PathProgramCache]: Analyzing trace with hash 453527745, now seen corresponding path program 1 times [2024-11-19 20:39:15,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:15,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841632355] [2024-11-19 20:39:15,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:15,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,263 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 20:39:15,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:15,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841632355] [2024-11-19 20:39:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841632355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:15,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:15,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:15,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680835333] [2024-11-19 20:39:15,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:15,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:15,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:15,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:15,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:15,265 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:15,285 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2024-11-19 20:39:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 76 [2024-11-19 20:39:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:15,286 INFO L225 Difference]: With dead ends: 76 [2024-11-19 20:39:15,286 INFO L226 Difference]: Without dead ends: 63 [2024-11-19 20:39:15,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:15,287 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:15,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:15,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-19 20:39:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2024-11-19 20:39:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 45 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:15,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2024-11-19 20:39:15,292 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 76 [2024-11-19 20:39:15,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:15,293 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2024-11-19 20:39:15,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:15,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2024-11-19 20:39:15,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 20:39:15,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:15,294 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:15,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 20:39:15,296 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:15,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:15,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1665566163, now seen corresponding path program 1 times [2024-11-19 20:39:15,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:15,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342995776] [2024-11-19 20:39:15,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:15,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:15,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:15,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-19 20:39:15,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342995776] [2024-11-19 20:39:15,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342995776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:15,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179304670] [2024-11-19 20:39:15,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:15,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:15,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:15,362 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-19 20:39:15,364 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-19 20:39:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:15,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 20:39:15,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 20:39:15,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-19 20:39:15,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179304670] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:15,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:15,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 10 [2024-11-19 20:39:15,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100688232] [2024-11-19 20:39:15,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:15,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:39:15,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:15,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:39:15,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:39:15,591 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:15,703 INFO L93 Difference]: Finished difference Result 107 states and 131 transitions. [2024-11-19 20:39:15,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 20:39:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2024-11-19 20:39:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:15,704 INFO L225 Difference]: With dead ends: 107 [2024-11-19 20:39:15,705 INFO L226 Difference]: Without dead ends: 94 [2024-11-19 20:39:15,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2024-11-19 20:39:15,706 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:15,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 232 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-19 20:39:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2024-11-19 20:39:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 77 states have (on average 1.077922077922078) internal successors, (83), 77 states have internal predecessors, (83), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2024-11-19 20:39:15,714 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 79 [2024-11-19 20:39:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:15,714 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2024-11-19 20:39:15,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 10 states have internal predecessors, (60), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2024-11-19 20:39:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 20:39:15,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:15,716 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:15,724 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-19 20:39:15,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 20:39:15,917 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:15,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash -548194093, now seen corresponding path program 2 times [2024-11-19 20:39:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:15,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706014064] [2024-11-19 20:39:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:15,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-19 20:39:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706014064] [2024-11-19 20:39:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706014064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353865689] [2024-11-19 20:39:16,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:39:16,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:16,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:39:16,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:39:16,186 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:39:16,187 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:16,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 20:39:16,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-19 20:39:16,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:16,324 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 78 proven. 22 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2024-11-19 20:39:16,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353865689] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:16,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:16,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-19 20:39:16,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347815691] [2024-11-19 20:39:16,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:16,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 20:39:16,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 20:39:16,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2024-11-19 20:39:16,327 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:16,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:16,459 INFO L93 Difference]: Finished difference Result 137 states and 155 transitions. [2024-11-19 20:39:16,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 20:39:16,459 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 111 [2024-11-19 20:39:16,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:16,460 INFO L225 Difference]: With dead ends: 137 [2024-11-19 20:39:16,460 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 20:39:16,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=358, Unknown=0, NotChecked=0, Total=552 [2024-11-19 20:39:16,461 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 57 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:16,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 503 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:39:16,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 20:39:16,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-19 20:39:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 92 states have (on average 1.065217391304348) internal successors, (98), 92 states have internal predecessors, (98), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2024-11-19 20:39:16,465 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 111 [2024-11-19 20:39:16,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:16,465 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2024-11-19 20:39:16,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.882352941176471) internal successors, (83), 17 states have internal predecessors, (83), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:16,466 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2024-11-19 20:39:16,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 20:39:16,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:16,466 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:16,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 20:39:16,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-19 20:39:16,669 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 313659905, now seen corresponding path program 3 times [2024-11-19 20:39:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:16,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401629579] [2024-11-19 20:39:16,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:16,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-19 20:39:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401629579] [2024-11-19 20:39:16,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401629579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:16,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490215017] [2024-11-19 20:39:16,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:39:16,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:16,773 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:39:16,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:39:16,879 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-19 20:39:16,879 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:16,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:39:16,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 98 proven. 4 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-19 20:39:16,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:16,961 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-19 20:39:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490215017] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:16,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:39:16,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2024-11-19 20:39:16,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100812695] [2024-11-19 20:39:16,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:39:16,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:16,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:39:16,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:39:16,965 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:17,001 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2024-11-19 20:39:17,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:39:17,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 126 [2024-11-19 20:39:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:17,002 INFO L225 Difference]: With dead ends: 117 [2024-11-19 20:39:17,002 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 20:39:17,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 264 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:39:17,003 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:17,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 219 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 20:39:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 20:39:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-11-19 20:39:17,008 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 126 [2024-11-19 20:39:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:17,009 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-11-19 20:39:17,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-11-19 20:39:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 20:39:17,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:17,011 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 6, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:17,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:39:17,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:17,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:17,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1299283323, now seen corresponding path program 4 times [2024-11-19 20:39:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509965076] [2024-11-19 20:39:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:17,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 272 proven. 56 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 20:39:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509965076] [2024-11-19 20:39:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509965076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486478166] [2024-11-19 20:39:17,408 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 20:39:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:17,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:17,410 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:39:17,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:39:17,521 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 20:39:17,521 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:17,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 20:39:17,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:17,628 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 206 proven. 172 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-19 20:39:17,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 225 proven. 153 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-19 20:39:17,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486478166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:17,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:17,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 26 [2024-11-19 20:39:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282057143] [2024-11-19 20:39:17,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:17,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 20:39:17,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 20:39:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2024-11-19 20:39:17,856 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:18,244 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2024-11-19 20:39:18,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-19 20:39:18,244 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 133 [2024-11-19 20:39:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:18,245 INFO L225 Difference]: With dead ends: 215 [2024-11-19 20:39:18,246 INFO L226 Difference]: Without dead ends: 188 [2024-11-19 20:39:18,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 260 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=713, Invalid=2257, Unknown=0, NotChecked=0, Total=2970 [2024-11-19 20:39:18,247 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 60 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:18,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 751 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:39:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-19 20:39:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 144. [2024-11-19 20:39:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 133 states have (on average 1.0751879699248121) internal successors, (143), 133 states have internal predecessors, (143), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:18,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2024-11-19 20:39:18,256 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 133 [2024-11-19 20:39:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:18,256 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2024-11-19 20:39:18,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.6923076923076925) internal successors, (122), 26 states have internal predecessors, (122), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2024-11-19 20:39:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-19 20:39:18,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:18,257 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 6, 6, 6, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:18,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 20:39:18,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 20:39:18,462 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:18,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:18,462 INFO L85 PathProgramCache]: Analyzing trace with hash -251669101, now seen corresponding path program 5 times [2024-11-19 20:39:18,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:18,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133741703] [2024-11-19 20:39:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:18,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 20:39:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 20:39:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 20:39:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 20:39:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:18,644 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 362 proven. 29 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-19 20:39:18,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133741703] [2024-11-19 20:39:18,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133741703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:18,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896976612] [2024-11-19 20:39:18,645 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 20:39:18,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:18,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:18,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:39:18,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:39:18,782 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2024-11-19 20:39:18,783 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:18,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 20:39:18,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 431 proven. 357 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-19 20:39:18,879 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 457 proven. 331 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-19 20:39:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896976612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:19,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 19 [2024-11-19 20:39:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470565953] [2024-11-19 20:39:19,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:19,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 20:39:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 20:39:19,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-19 20:39:19,063 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:19,299 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2024-11-19 20:39:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 20:39:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 161 [2024-11-19 20:39:19,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:19,301 INFO L225 Difference]: With dead ends: 244 [2024-11-19 20:39:19,301 INFO L226 Difference]: Without dead ends: 161 [2024-11-19 20:39:19,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 323 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 20:39:19,302 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:19,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 621 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:39:19,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-19 20:39:19,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-11-19 20:39:19,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 150 states have (on average 1.0666666666666667) internal successors, (160), 150 states have internal predecessors, (160), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 20:39:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2024-11-19 20:39:19,310 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 161 [2024-11-19 20:39:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:19,310 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2024-11-19 20:39:19,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-19 20:39:19,310 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2024-11-19 20:39:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-19 20:39:19,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:19,311 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 20:39:19,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 20:39:19,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 20:39:19,512 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:19,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:19,513 INFO L85 PathProgramCache]: Analyzing trace with hash 773529361, now seen corresponding path program 6 times [2024-11-19 20:39:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40066935] [2024-11-19 20:39:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:39:19,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 20:39:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:39:19,740 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 20:39:19,741 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 20:39:19,742 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:39:19,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 20:39:19,746 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:39:19,798 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:39:19,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:39:19 BoogieIcfgContainer [2024-11-19 20:39:19,800 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 20:39:19,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 20:39:19,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 20:39:19,801 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 20:39:19,801 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:39:13" (3/4) ... [2024-11-19 20:39:19,801 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 20:39:19,862 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 20:39:19,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 20:39:19,863 INFO L158 Benchmark]: Toolchain (without parser) took 7324.02ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 149.2MB in the beginning and 160.6MB in the end (delta: -11.5MB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,863 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:39:19,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.99ms. Allocated memory is still 178.3MB. Free memory was 149.2MB in the beginning and 135.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.43ms. Allocated memory is still 178.3MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,864 INFO L158 Benchmark]: Boogie Preprocessor took 41.70ms. Allocated memory is still 178.3MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,864 INFO L158 Benchmark]: RCFGBuilder took 431.72ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 111.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,865 INFO L158 Benchmark]: TraceAbstraction took 6517.05ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 110.2MB in the beginning and 166.9MB in the end (delta: -56.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,865 INFO L158 Benchmark]: Witness Printer took 62.02ms. Allocated memory is still 257.9MB. Free memory was 166.9MB in the beginning and 160.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 20:39:19,866 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 92.3MB in the beginning and 92.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.99ms. Allocated memory is still 178.3MB. Free memory was 149.2MB in the beginning and 135.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.43ms. Allocated memory is still 178.3MB. Free memory was 135.3MB in the beginning and 133.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.70ms. Allocated memory is still 178.3MB. Free memory was 133.2MB in the beginning and 131.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.72ms. Allocated memory is still 178.3MB. Free memory was 131.1MB in the beginning and 111.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6517.05ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 110.2MB in the beginning and 166.9MB in the end (delta: -56.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Witness Printer took 62.02ms. Allocated memory is still 257.9MB. Free memory was 166.9MB in the beginning and 160.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L58] int s, e, n, d, m, o, r, y; [L59] s = __VERIFIER_nondet_int() [L60] e = __VERIFIER_nondet_int() [L61] n = __VERIFIER_nondet_int() [L62] d = __VERIFIER_nondet_int() [L63] m = __VERIFIER_nondet_int() [L64] o = __VERIFIER_nondet_int() [L65] r = __VERIFIER_nondet_int() [L66] y = __VERIFIER_nondet_int() [L67] CALL, EXPR solve(s, e, n, d, m, o, r, y) [L46] CALL, EXPR check_domain_1(S) VAL [\old(x)=9] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=9, \result=1] [L46] RET, EXPR check_domain_1(S) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(E) VAL [\old(x)=5] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=5, \result=1] [L46] RET, EXPR check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] CALL, EXPR check_domain_0(N) VAL [\old(x)=6] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=6, \result=1] [L46] RET, EXPR check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(D) VAL [\old(x)=7] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=7, \result=1] [L47] RET, EXPR check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_1(M) VAL [\old(x)=1] [L32] COND TRUE x >= 1 && x <= 9 [L32] return 1; VAL [\old(x)=1, \result=1] [L47] RET, EXPR check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L47] CALL, EXPR check_domain_0(O) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=0, \result=1] [L47] RET, EXPR check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L47] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(R) VAL [\old(x)=8] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=8, \result=1] [L48] RET, EXPR check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L48] CALL, EXPR check_domain_0(Y) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 9 [L28] return 1; VAL [\old(x)=2, \result=1] [L48] RET, EXPR check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L48] EXPR check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) VAL [D=7, E=5, M=1, N=6, O=0, R=8, S=9, Y=2] [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L51] CALL, EXPR check_diff(S, E, N, D, M, O, R, Y) [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L38] int i = 0; VAL [d={10:0}, i=0] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=0, j=1] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=0, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=0] [L38] i++ VAL [d={10:0}, i=1] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=1, j=2] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=1, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=1] [L38] i++ VAL [d={10:0}, i=2] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=2, j=3] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=2, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=2] [L38] i++ VAL [d={10:0}, i=3] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=3, j=4] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=3, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=3] [L38] i++ VAL [d={10:0}, i=4] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=4, j=5] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=4, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=4] [L38] i++ VAL [d={10:0}, i=5] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=5, j=6] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=5, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=5] [L38] i++ VAL [d={10:0}, i=6] [L38] COND TRUE i < 7 [L39] int j = i + 1; VAL [d={10:0}, i=6, j=7] [L39] COND TRUE j < 8 [L40] EXPR d[i] [L40] EXPR d[j] [L40] COND FALSE !(d[i] == d[j]) [L39] j++ VAL [d={10:0}, i=6, j=8] [L39] COND FALSE !(j < 8) VAL [d={10:0}, i=6] [L38] i++ VAL [d={10:0}, i=7] [L38] COND FALSE !(i < 7) VAL [d={10:0}] [L42] return 1; [L37] int d[8] = {S, E, N, D, M, O, R, Y}; [L42] return 1; VAL [\result=1] [L51] RET, EXPR check_diff(S, E, N, D, M, O, R, Y) [L46-L51] check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L46-L51] COND TRUE check_domain_1(S) && check_domain_0(E) && check_domain_0(N) && check_domain_0(D) && check_domain_1(M) && check_domain_0(O) && check_domain_0(R) && check_domain_0(Y) && (1000 * S + 100 * E + 10 * N + D + 1000 * M + 100 * O + 10 * R + E == 10000 * M + 1000 * O + 100 * N + 10 * E + Y) && check_diff(S, E, N, D, M, O, R, Y) [L52] return 1; VAL [\result=1] [L67] RET, EXPR solve(s, e, n, d, m, o, r, y) [L67] CALL __VERIFIER_assert(!solve(s, e, n, d, m, o, r, y)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.4s, OverallIterations: 19, TraceHistogramMax: 28, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 200 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 4708 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3526 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 1182 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1547 GetRequests, 1365 SyntacticMatches, 19 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161occurred in iteration=18, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 68 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 1934 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 2405 ConstructedInterpolants, 0 QuantifiedInterpolants, 3446 SizeOfPredicates, 7 NumberOfNonLiveVariables, 1658 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 14 PerfectInterpolantSequences, 5430/6605 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-19 20:39:19,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE