./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-magicseries1.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-magicseries1.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 36e10b539b0c5593d108c5ae8d5aca590fa779f1bae4b76f536932feddfdfc87 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:39:05,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:39:05,970 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:05,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:39:05,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:39:06,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:39:06,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:39:06,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:39:06,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:39:06,010 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:39:06,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:39:06,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:39:06,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:39:06,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:39:06,012 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:39:06,013 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:39:06,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:39:06,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:39:06,014 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:39:06,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:39:06,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:39:06,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:39:06,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:39:06,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:39:06,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:39:06,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:39:06,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:39:06,017 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:39:06,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:39:06,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:39:06,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:39:06,018 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:39:06,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:39:06,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:39:06,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:39:06,019 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:39:06,019 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:39:06,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:39:06,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:39:06,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:39:06,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:39:06,021 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:39:06,021 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 -> 36e10b539b0c5593d108c5ae8d5aca590fa779f1bae4b76f536932feddfdfc87 [2024-11-19 20:39:06,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:39:06,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:39:06,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:39:06,286 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:39:06,286 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:39:06,287 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2024-11-19 20:39:07,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:39:07,895 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:39:07,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries1.c [2024-11-19 20:39:07,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916906327/d693e9930e0a48dfa34ccb7e1d601715/FLAGfbd6fdfc5 [2024-11-19 20:39:07,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/916906327/d693e9930e0a48dfa34ccb7e1d601715 [2024-11-19 20:39:07,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:39:07,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:39:07,923 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:39:07,923 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:39:07,928 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:39:07,928 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:39:07" (1/1) ... [2024-11-19 20:39:07,929 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ada0a53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:07, skipping insertion in model container [2024-11-19 20:39:07,929 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:39:07" (1/1) ... [2024-11-19 20:39:07,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:39:08,134 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-magicseries1.c[613,626] [2024-11-19 20:39:08,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:39:08,175 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:39:08,187 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-magicseries1.c[613,626] [2024-11-19 20:39:08,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:39:08,222 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:39:08,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:08 WrapperNode [2024-11-19 20:39:08,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:39:08,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:39:08,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:39:08,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:39:08,231 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:08" (1/1) ... [2024-11-19 20:39:08,244 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:08" (1/1) ... [2024-11-19 20:39:08,271 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2024-11-19 20:39:08,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:39:08,276 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:39:08,276 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:39:08,276 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:39:08,288 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:08" (1/1) ... [2024-11-19 20:39:08,289 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:08" (1/1) ... [2024-11-19 20:39:08,292 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:08" (1/1) ... [2024-11-19 20:39:08,311 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-19 20:39:08,311 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:08" (1/1) ... [2024-11-19 20:39:08,312 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:08" (1/1) ... [2024-11-19 20:39:08,317 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:08" (1/1) ... [2024-11-19 20:39:08,320 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:08" (1/1) ... [2024-11-19 20:39:08,321 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:08" (1/1) ... [2024-11-19 20:39:08,322 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:08" (1/1) ... [2024-11-19 20:39:08,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:39:08,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:39:08,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:39:08,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:39:08,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:08" (1/1) ... [2024-11-19 20:39:08,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:39:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:08,381 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:08,384 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:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:39:08,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:39:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-19 20:39:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-19 20:39:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:39:08,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:39:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:39:08,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:39:08,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:39:08,496 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:39:08,500 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:39:08,682 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-19 20:39:08,682 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:39:08,695 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:39:08,695 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 20:39:08,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:39:08 BoogieIcfgContainer [2024-11-19 20:39:08,696 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:39:08,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:39:08,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:39:08,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:39:08,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:39:07" (1/3) ... [2024-11-19 20:39:08,709 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b74f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:39:08, skipping insertion in model container [2024-11-19 20:39:08,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:39:08" (2/3) ... [2024-11-19 20:39:08,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b74f76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:39:08, skipping insertion in model container [2024-11-19 20:39:08,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:39:08" (3/3) ... [2024-11-19 20:39:08,711 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries1.c [2024-11-19 20:39:08,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:39:08,730 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:39:08,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:39:08,789 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;@7863f2d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:39:08,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:39:08,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 20:39:08,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:08,802 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:39:08,803 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:08,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash -173200605, now seen corresponding path program 1 times [2024-11-19 20:39:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:08,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484229032] [2024-11-19 20:39:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:08,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,169 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:09,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:09,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484229032] [2024-11-19 20:39:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484229032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:09,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:39:09,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095455997] [2024-11-19 20:39:09,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:09,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:39:09,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:39:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:39:09,202 INFO L87 Difference]: Start difference. First operand has 38 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:09,253 INFO L93 Difference]: Finished difference Result 73 states and 104 transitions. [2024-11-19 20:39:09,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:39:09,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2024-11-19 20:39:09,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:09,263 INFO L225 Difference]: With dead ends: 73 [2024-11-19 20:39:09,263 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:39:09,266 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:09,269 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 179 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:09,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 179 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:09,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:39:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 20:39:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 20:39:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2024-11-19 20:39:09,343 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 17 [2024-11-19 20:39:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:09,345 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2024-11-19 20:39:09,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:09,346 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2024-11-19 20:39:09,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-19 20:39:09,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:09,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:39:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:39:09,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -466603612, now seen corresponding path program 1 times [2024-11-19 20:39:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310405741] [2024-11-19 20:39:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,521 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:09,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:09,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310405741] [2024-11-19 20:39:09,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310405741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:09,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:09,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979049342] [2024-11-19 20:39:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:09,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:09,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:09,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:09,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:09,529 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:09,552 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2024-11-19 20:39:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:09,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2024-11-19 20:39:09,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:09,554 INFO L225 Difference]: With dead ends: 42 [2024-11-19 20:39:09,555 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:39:09,556 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:09,557 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:09,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:39:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 20:39:09,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 20:39:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2024-11-19 20:39:09,565 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 17 [2024-11-19 20:39:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:09,566 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2024-11-19 20:39:09,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2024-11-19 20:39:09,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-19 20:39:09,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:09,567 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] [2024-11-19 20:39:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:39:09,569 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:09,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:09,570 INFO L85 PathProgramCache]: Analyzing trace with hash -97449680, now seen corresponding path program 1 times [2024-11-19 20:39:09,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:09,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556135421] [2024-11-19 20:39:09,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,649 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:09,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:09,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556135421] [2024-11-19 20:39:09,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556135421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:09,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:39:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911856730] [2024-11-19 20:39:09,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:09,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:39:09,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:09,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:39:09,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:39:09,653 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:09,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:09,669 INFO L93 Difference]: Finished difference Result 53 states and 69 transitions. [2024-11-19 20:39:09,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:39:09,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 21 [2024-11-19 20:39:09,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:09,672 INFO L225 Difference]: With dead ends: 53 [2024-11-19 20:39:09,672 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:39:09,672 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:09,673 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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:09,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 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:09,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:39:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 20:39:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 20:39:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 50 transitions. [2024-11-19 20:39:09,681 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 50 transitions. Word has length 21 [2024-11-19 20:39:09,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 50 transitions. [2024-11-19 20:39:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 50 transitions. [2024-11-19 20:39:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 20:39:09,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:09,684 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 20:39:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:39:09,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:09,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1606193460, now seen corresponding path program 1 times [2024-11-19 20:39:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275520687] [2024-11-19 20:39:09,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:09,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 20:39:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,787 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:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:09,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275520687] [2024-11-19 20:39:09,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275520687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:09,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:09,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771811359] [2024-11-19 20:39:09,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:09,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:09,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:09,790 INFO L87 Difference]: Start difference. First operand 38 states and 50 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:09,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:09,823 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2024-11-19 20:39:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:09,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 27 [2024-11-19 20:39:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:09,826 INFO L225 Difference]: With dead ends: 63 [2024-11-19 20:39:09,826 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:39:09,827 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:09,828 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 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:09,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 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:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:39:09,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 20:39:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 20:39:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2024-11-19 20:39:09,839 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 27 [2024-11-19 20:39:09,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:09,839 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2024-11-19 20:39:09,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2024-11-19 20:39:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:39:09,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:09,842 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-11-19 20:39:09,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 20:39:09,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:09,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:09,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1389600499, now seen corresponding path program 1 times [2024-11-19 20:39:09,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:09,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803199964] [2024-11-19 20:39:09,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:09,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:09,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 20:39:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 20:39:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:09,943 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:09,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:09,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803199964] [2024-11-19 20:39:09,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803199964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:09,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:09,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:09,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881239356] [2024-11-19 20:39:09,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:09,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:09,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:09,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:09,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:09,947 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:09,981 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2024-11-19 20:39:09,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:09,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 33 [2024-11-19 20:39:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:09,982 INFO L225 Difference]: With dead ends: 67 [2024-11-19 20:39:09,983 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:39:09,983 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:09,985 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 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:09,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 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:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:39:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2024-11-19 20:39:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2024-11-19 20:39:09,998 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 33 [2024-11-19 20:39:09,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:09,998 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2024-11-19 20:39:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2024-11-19 20:39:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 20:39:10,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:10,001 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 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:10,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:39:10,001 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1645112148, now seen corresponding path program 1 times [2024-11-19 20:39:10,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:10,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658137182] [2024-11-19 20:39:10,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 20:39:10,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:10,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658137182] [2024-11-19 20:39:10,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658137182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:10,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:39:10,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698183944] [2024-11-19 20:39:10,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:39:10,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:39:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:39:10,101 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:10,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:10,128 INFO L93 Difference]: Finished difference Result 49 states and 59 transitions. [2024-11-19 20:39:10,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:39:10,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-19 20:39:10,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:10,130 INFO L225 Difference]: With dead ends: 49 [2024-11-19 20:39:10,131 INFO L226 Difference]: Without dead ends: 42 [2024-11-19 20:39:10,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:10,133 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 9 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:10,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 68 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:10,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-19 20:39:10,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2024-11-19 20:39:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:10,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-19 20:39:10,140 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 39 [2024-11-19 20:39:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:10,141 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-19 20:39:10,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:10,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-19 20:39:10,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 20:39:10,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:10,143 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 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:10,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 20:39:10,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:10,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1930899933, now seen corresponding path program 1 times [2024-11-19 20:39:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607238059] [2024-11-19 20:39:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:10,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 20:39:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607238059] [2024-11-19 20:39:10,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607238059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:10,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:10,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:39:10,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544000083] [2024-11-19 20:39:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:10,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:39:10,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:10,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:39:10,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:39:10,246 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:10,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:10,266 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-19 20:39:10,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:39:10,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-19 20:39:10,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:10,268 INFO L225 Difference]: With dead ends: 52 [2024-11-19 20:39:10,268 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 20:39:10,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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:10,269 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:10,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:10,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 20:39:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-19 20:39:10,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-19 20:39:10,279 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 41 [2024-11-19 20:39:10,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:10,281 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-19 20:39:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-19 20:39:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 20:39:10,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:10,283 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 20:39:10,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:10,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1158681494, now seen corresponding path program 1 times [2024-11-19 20:39:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:10,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920698622] [2024-11-19 20:39:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,439 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 20:39:10,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920698622] [2024-11-19 20:39:10,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920698622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:10,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856791526] [2024-11-19 20:39:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:10,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:10,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:10,445 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:10,446 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:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:10,578 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 20:39:10,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:10,632 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 20:39:10,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 20:39:10,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856791526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:10,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:10,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 20:39:10,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682813214] [2024-11-19 20:39:10,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:10,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:39:10,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:10,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:39:10,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:39:10,691 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:10,722 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2024-11-19 20:39:10,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:39:10,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2024-11-19 20:39:10,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:10,725 INFO L225 Difference]: With dead ends: 60 [2024-11-19 20:39:10,725 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 20:39:10,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:39:10,726 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:10,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 77 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 20:39:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 20:39:10,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-19 20:39:10,738 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 44 [2024-11-19 20:39:10,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:10,738 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-19 20:39:10,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-19 20:39:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-19 20:39:10,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:10,740 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 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:10,751 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:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:10,945 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash 60507235, now seen corresponding path program 2 times [2024-11-19 20:39:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:10,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677196433] [2024-11-19 20:39:10,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:10,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 20:39:11,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677196433] [2024-11-19 20:39:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677196433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:39:11,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:39:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:39:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310464144] [2024-11-19 20:39:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:39:11,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:39:11,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:11,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:39:11,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:39:11,031 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:11,052 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2024-11-19 20:39:11,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:39:11,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 53 [2024-11-19 20:39:11,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:11,054 INFO L225 Difference]: With dead ends: 51 [2024-11-19 20:39:11,054 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 20:39:11,054 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:11,056 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:11,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:11,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 20:39:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 20:39:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-19 20:39:11,063 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 53 [2024-11-19 20:39:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:11,064 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-19 20:39:11,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:11,064 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-19 20:39:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-19 20:39:11,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:11,065 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 20:39:11,066 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:11,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:11,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1306236444, now seen corresponding path program 1 times [2024-11-19 20:39:11,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:11,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95500592] [2024-11-19 20:39:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:11,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,144 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 20:39:11,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95500592] [2024-11-19 20:39:11,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95500592] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:11,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21293041] [2024-11-19 20:39:11,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:11,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:11,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:11,148 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:11,149 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:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:11,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 20:39:11,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 20:39:11,279 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:11,343 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-19 20:39:11,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21293041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:11,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:11,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 20:39:11,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148323583] [2024-11-19 20:39:11,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:11,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:39:11,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:11,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:39:11,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:39:11,345 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:11,389 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2024-11-19 20:39:11,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:39:11,389 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 56 [2024-11-19 20:39:11,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:11,391 INFO L225 Difference]: With dead ends: 103 [2024-11-19 20:39:11,392 INFO L226 Difference]: Without dead ends: 96 [2024-11-19 20:39:11,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:39:11,393 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:11,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 105 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:39:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-19 20:39:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-19 20:39:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 90 states have internal predecessors, (112), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 120 transitions. [2024-11-19 20:39:11,409 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 120 transitions. Word has length 56 [2024-11-19 20:39:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:11,409 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 120 transitions. [2024-11-19 20:39:11,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 120 transitions. [2024-11-19 20:39:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:11,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:11,410 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:11,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 20:39:11,611 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,SelfDestructingSolverStorable9 [2024-11-19 20:39:11,611 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:11,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:11,612 INFO L85 PathProgramCache]: Analyzing trace with hash -632814932, now seen corresponding path program 2 times [2024-11-19 20:39:11,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:11,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921585189] [2024-11-19 20:39:11,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:11,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:12,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:12,547 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 241 proven. 86 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-19 20:39:12,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:12,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921585189] [2024-11-19 20:39:12,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921585189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:12,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807772491] [2024-11-19 20:39:12,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:39:12,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:12,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:12,551 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:12,553 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:12,687 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:39:12,688 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:12,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 20:39:12,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:13,152 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 92 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 20:39:13,153 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:13,324 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 20:39:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 82 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-19 20:39:13,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807772491] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:13,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:13,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 35 [2024-11-19 20:39:13,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843830492] [2024-11-19 20:39:13,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:13,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 20:39:13,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:13,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 20:39:13,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1069, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 20:39:13,509 INFO L87 Difference]: Start difference. First operand 96 states and 120 transitions. Second operand has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 35 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:16,810 INFO L93 Difference]: Finished difference Result 393 states and 510 transitions. [2024-11-19 20:39:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-19 20:39:16,810 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 35 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:16,812 INFO L225 Difference]: With dead ends: 393 [2024-11-19 20:39:16,812 INFO L226 Difference]: Without dead ends: 301 [2024-11-19 20:39:16,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4873 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1355, Invalid=13897, Unknown=0, NotChecked=0, Total=15252 [2024-11-19 20:39:16,819 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 331 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 2185 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 2193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:16,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 662 Invalid, 2193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2185 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 20:39:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-19 20:39:16,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2024-11-19 20:39:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 248 states have internal predecessors, (322), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 330 transitions. [2024-11-19 20:39:16,852 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 330 transitions. Word has length 107 [2024-11-19 20:39:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:16,853 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 330 transitions. [2024-11-19 20:39:16,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.085714285714286) internal successors, (108), 35 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:16,853 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 330 transitions. [2024-11-19 20:39:16,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:16,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:16,856 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 13, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 20:39:16,867 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,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:17,057 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:17,058 INFO L85 PathProgramCache]: Analyzing trace with hash -519370386, now seen corresponding path program 1 times [2024-11-19 20:39:17,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:17,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854321054] [2024-11-19 20:39:17,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,807 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 83 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2024-11-19 20:39:17,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854321054] [2024-11-19 20:39:17,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854321054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:17,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807960630] [2024-11-19 20:39:17,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:17,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:17,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:17,811 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,813 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,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:17,924 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-19 20:39:17,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 224 proven. 177 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-19 20:39:18,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:18,641 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 20:39:18,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2024-11-19 20:39:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 323 proven. 60 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2024-11-19 20:39:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807960630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:18,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 12] total 43 [2024-11-19 20:39:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371393413] [2024-11-19 20:39:18,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-19 20:39:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-19 20:39:18,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1639, Unknown=0, NotChecked=0, Total=1806 [2024-11-19 20:39:18,735 INFO L87 Difference]: Start difference. First operand 254 states and 330 transitions. Second operand has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 43 states have internal predecessors, (134), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:24,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:24,068 INFO L93 Difference]: Finished difference Result 1066 states and 1373 transitions. [2024-11-19 20:39:24,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2024-11-19 20:39:24,069 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 43 states have internal predecessors, (134), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:24,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:24,075 INFO L225 Difference]: With dead ends: 1066 [2024-11-19 20:39:24,076 INFO L226 Difference]: Without dead ends: 897 [2024-11-19 20:39:24,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21983 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3293, Invalid=53113, Unknown=0, NotChecked=0, Total=56406 [2024-11-19 20:39:24,091 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 532 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:24,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 820 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 20:39:24,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-19 20:39:24,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 760. [2024-11-19 20:39:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 754 states have (on average 1.2705570291777188) internal successors, (958), 754 states have internal predecessors, (958), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 966 transitions. [2024-11-19 20:39:24,141 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 966 transitions. Word has length 107 [2024-11-19 20:39:24,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:24,142 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 966 transitions. [2024-11-19 20:39:24,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.116279069767442) internal successors, (134), 43 states have internal predecessors, (134), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 966 transitions. [2024-11-19 20:39:24,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:24,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:24,144 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:24,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 20:39:24,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:24,349 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:24,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 24855208, now seen corresponding path program 2 times [2024-11-19 20:39:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:24,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808868199] [2024-11-19 20:39:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:25,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 108 proven. 306 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 20:39:25,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:25,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808868199] [2024-11-19 20:39:25,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808868199] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:25,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207635156] [2024-11-19 20:39:25,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:39:25,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:25,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:25,013 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:25,015 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:25,118 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:39:25,118 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:25,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 20:39:25,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 237 proven. 134 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-19 20:39:25,434 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:25,568 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 20:39:25,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2024-11-19 20:39:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 324 proven. 36 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-19 20:39:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207635156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:25,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 10] total 35 [2024-11-19 20:39:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026917312] [2024-11-19 20:39:25,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:25,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-19 20:39:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-19 20:39:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 20:39:25,615 INFO L87 Difference]: Start difference. First operand 760 states and 966 transitions. Second operand has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:27,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:27,802 INFO L93 Difference]: Finished difference Result 2820 states and 3530 transitions. [2024-11-19 20:39:27,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-19 20:39:27,803 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:27,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:27,811 INFO L225 Difference]: With dead ends: 2820 [2024-11-19 20:39:27,811 INFO L226 Difference]: Without dead ends: 2192 [2024-11-19 20:39:27,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1043, Invalid=10729, Unknown=0, NotChecked=0, Total=11772 [2024-11-19 20:39:27,816 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 183 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:27,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 689 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 20:39:27,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2024-11-19 20:39:27,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1772. [2024-11-19 20:39:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1772 states, 1766 states have (on average 1.2298980747451869) internal successors, (2172), 1766 states have internal predecessors, (2172), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1772 states to 1772 states and 2180 transitions. [2024-11-19 20:39:27,917 INFO L78 Accepts]: Start accepts. Automaton has 1772 states and 2180 transitions. Word has length 107 [2024-11-19 20:39:27,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:27,917 INFO L471 AbstractCegarLoop]: Abstraction has 1772 states and 2180 transitions. [2024-11-19 20:39:27,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.8) internal successors, (133), 35 states have internal predecessors, (133), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:27,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1772 states and 2180 transitions. [2024-11-19 20:39:27,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:27,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:27,922 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:27,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 20:39:28,125 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,SelfDestructingSolverStorable12 [2024-11-19 20:39:28,126 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1588139156, now seen corresponding path program 3 times [2024-11-19 20:39:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882132101] [2024-11-19 20:39:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:28,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 188 proven. 15 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-19 20:39:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882132101] [2024-11-19 20:39:28,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882132101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920448598] [2024-11-19 20:39:28,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:39:28,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:28,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:28,626 INFO L229 MonitoredProcess]: Starting monitored process 7 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:28,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:39:28,734 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-11-19 20:39:28,734 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:28,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 20:39:28,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:28,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:28,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-19 20:39:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-11-19 20:39:29,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:29,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:29,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2024-11-19 20:39:29,513 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 344 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-19 20:39:29,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920448598] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:29,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:29,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 19] total 42 [2024-11-19 20:39:29,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945194916] [2024-11-19 20:39:29,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:29,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-19 20:39:29,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:29,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-19 20:39:29,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=1380, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 20:39:29,516 INFO L87 Difference]: Start difference. First operand 1772 states and 2180 transitions. Second operand has 42 states, 42 states have (on average 3.0714285714285716) internal successors, (129), 42 states have internal predecessors, (129), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:33,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:33,056 INFO L93 Difference]: Finished difference Result 6144 states and 7752 transitions. [2024-11-19 20:39:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-19 20:39:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.0714285714285716) internal successors, (129), 42 states have internal predecessors, (129), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:33,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:33,072 INFO L225 Difference]: With dead ends: 6144 [2024-11-19 20:39:33,072 INFO L226 Difference]: Without dead ends: 4562 [2024-11-19 20:39:33,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5751, Invalid=26111, Unknown=0, NotChecked=0, Total=31862 [2024-11-19 20:39:33,078 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 537 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:33,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 529 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 20:39:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4562 states. [2024-11-19 20:39:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4562 to 3774. [2024-11-19 20:39:33,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3774 states, 3768 states have (on average 1.265923566878981) internal successors, (4770), 3768 states have internal predecessors, (4770), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3774 states to 3774 states and 4778 transitions. [2024-11-19 20:39:33,364 INFO L78 Accepts]: Start accepts. Automaton has 3774 states and 4778 transitions. Word has length 107 [2024-11-19 20:39:33,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:33,365 INFO L471 AbstractCegarLoop]: Abstraction has 3774 states and 4778 transitions. [2024-11-19 20:39:33,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0714285714285716) internal successors, (129), 42 states have internal predecessors, (129), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:33,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3774 states and 4778 transitions. [2024-11-19 20:39:33,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:33,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:33,374 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 10, 6, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:33,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 20:39:33,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:33,578 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:33,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:33,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1945055824, now seen corresponding path program 4 times [2024-11-19 20:39:33,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:33,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573885820] [2024-11-19 20:39:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:33,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:33,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:34,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:34,169 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 392 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-11-19 20:39:34,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:34,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573885820] [2024-11-19 20:39:34,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573885820] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:34,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697095055] [2024-11-19 20:39:34,170 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 20:39:34,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:34,173 INFO L229 MonitoredProcess]: Starting monitored process 8 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:34,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:39:34,275 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 20:39:34,276 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:34,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 20:39:34,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:34,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 20:39:34,449 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 311 proven. 50 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-19 20:39:34,450 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:34,585 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 20:39:34,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 9 [2024-11-19 20:39:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 278 proven. 83 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-19 20:39:34,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697095055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:34,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:34,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 11] total 30 [2024-11-19 20:39:34,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189369189] [2024-11-19 20:39:34,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:34,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-19 20:39:34,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:34,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-19 20:39:34,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2024-11-19 20:39:34,602 INFO L87 Difference]: Start difference. First operand 3774 states and 4778 transitions. Second operand has 30 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:36,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:36,432 INFO L93 Difference]: Finished difference Result 10419 states and 13223 transitions. [2024-11-19 20:39:36,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2024-11-19 20:39:36,433 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:36,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:36,458 INFO L225 Difference]: With dead ends: 10419 [2024-11-19 20:39:36,458 INFO L226 Difference]: Without dead ends: 8006 [2024-11-19 20:39:36,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3197 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=886, Invalid=8620, Unknown=0, NotChecked=0, Total=9506 [2024-11-19 20:39:36,466 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 155 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:36,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 585 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:39:36,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8006 states. [2024-11-19 20:39:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8006 to 3813. [2024-11-19 20:39:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3813 states, 3807 states have (on average 1.2681901759915943) internal successors, (4828), 3807 states have internal predecessors, (4828), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 4836 transitions. [2024-11-19 20:39:36,895 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 4836 transitions. Word has length 107 [2024-11-19 20:39:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:36,896 INFO L471 AbstractCegarLoop]: Abstraction has 3813 states and 4836 transitions. [2024-11-19 20:39:36,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.966666666666667) internal successors, (119), 30 states have internal predecessors, (119), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 4836 transitions. [2024-11-19 20:39:36,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:36,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:36,902 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:36,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 20:39:37,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:37,103 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:37,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2120567892, now seen corresponding path program 5 times [2024-11-19 20:39:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:37,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305822874] [2024-11-19 20:39:37,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:37,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:37,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:37,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 247 proven. 98 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-19 20:39:37,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:37,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305822874] [2024-11-19 20:39:37,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305822874] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:37,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563070916] [2024-11-19 20:39:37,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-19 20:39:37,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:37,721 INFO L229 MonitoredProcess]: Starting monitored process 9 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:37,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 20:39:37,849 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2024-11-19 20:39:37,850 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:37,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 20:39:37,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:38,152 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 101 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-19 20:39:38,152 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:38,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:38,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-19 20:39:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 244 proven. 101 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-19 20:39:38,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563070916] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:38,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:38,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2024-11-19 20:39:38,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571394411] [2024-11-19 20:39:38,348 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:38,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-19 20:39:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:38,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-19 20:39:38,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 20:39:38,350 INFO L87 Difference]: Start difference. First operand 3813 states and 4836 transitions. Second operand has 33 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:39,471 INFO L93 Difference]: Finished difference Result 13821 states and 17737 transitions. [2024-11-19 20:39:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-19 20:39:39,472 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:39,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:39,510 INFO L225 Difference]: With dead ends: 13821 [2024-11-19 20:39:39,510 INFO L226 Difference]: Without dead ends: 10313 [2024-11-19 20:39:39,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=2096, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 20:39:39,517 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 122 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:39,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 667 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:39:39,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10313 states. [2024-11-19 20:39:40,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10313 to 7983. [2024-11-19 20:39:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 7977 states have (on average 1.2719067318540804) internal successors, (10146), 7977 states have internal predecessors, (10146), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 10154 transitions. [2024-11-19 20:39:40,267 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 10154 transitions. Word has length 107 [2024-11-19 20:39:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:40,267 INFO L471 AbstractCegarLoop]: Abstraction has 7983 states and 10154 transitions. [2024-11-19 20:39:40,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:40,268 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 10154 transitions. [2024-11-19 20:39:40,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:40,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:40,280 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 13, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-19 20:39:40,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 20:39:40,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 20:39:40,480 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:40,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:40,481 INFO L85 PathProgramCache]: Analyzing trace with hash 329032238, now seen corresponding path program 6 times [2024-11-19 20:39:40,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:40,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772230332] [2024-11-19 20:39:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:41,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:41,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:41,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:41,080 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 235 proven. 162 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-19 20:39:41,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:41,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772230332] [2024-11-19 20:39:41,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772230332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:41,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479799087] [2024-11-19 20:39:41,082 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-19 20:39:41,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:41,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:41,084 INFO L229 MonitoredProcess]: Starting monitored process 10 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:41,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 20:39:41,217 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2024-11-19 20:39:41,218 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:41,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 20:39:41,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:41,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:41,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2024-11-19 20:39:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 13 proven. 399 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-19 20:39:41,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:41,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:41,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2024-11-19 20:39:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 13 proven. 399 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-19 20:39:42,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479799087] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:42,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:42,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 40 [2024-11-19 20:39:42,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316301795] [2024-11-19 20:39:42,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:42,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-19 20:39:42,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:42,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-19 20:39:42,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2024-11-19 20:39:42,004 INFO L87 Difference]: Start difference. First operand 7983 states and 10154 transitions. Second operand has 40 states, 40 states have (on average 3.65) internal successors, (146), 40 states have internal predecessors, (146), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:43,963 INFO L93 Difference]: Finished difference Result 12088 states and 15796 transitions. [2024-11-19 20:39:43,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-19 20:39:43,963 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.65) internal successors, (146), 40 states have internal predecessors, (146), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:43,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:43,982 INFO L225 Difference]: With dead ends: 12088 [2024-11-19 20:39:43,982 INFO L226 Difference]: Without dead ends: 7020 [2024-11-19 20:39:43,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 198 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2677 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1040, Invalid=7702, Unknown=0, NotChecked=0, Total=8742 [2024-11-19 20:39:43,994 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 137 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:43,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 661 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:39:43,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7020 states. [2024-11-19 20:39:44,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7020 to 5565. [2024-11-19 20:39:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5565 states, 5559 states have (on average 1.2683935959704984) internal successors, (7051), 5559 states have internal predecessors, (7051), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:44,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5565 states to 5565 states and 7059 transitions. [2024-11-19 20:39:44,711 INFO L78 Accepts]: Start accepts. Automaton has 5565 states and 7059 transitions. Word has length 107 [2024-11-19 20:39:44,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:44,711 INFO L471 AbstractCegarLoop]: Abstraction has 5565 states and 7059 transitions. [2024-11-19 20:39:44,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.65) internal successors, (146), 40 states have internal predecessors, (146), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:44,711 INFO L276 IsEmpty]: Start isEmpty. Operand 5565 states and 7059 transitions. [2024-11-19 20:39:44,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:44,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:44,722 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:44,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 20:39:44,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 20:39:44,923 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:44,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1517228116, now seen corresponding path program 7 times [2024-11-19 20:39:44,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:44,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256069926] [2024-11-19 20:39:44,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:44,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 333 proven. 67 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-19 20:39:45,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256069926] [2024-11-19 20:39:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256069926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705560719] [2024-11-19 20:39:45,487 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-19 20:39:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:45,489 INFO L229 MonitoredProcess]: Starting monitored process 11 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:45,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 20:39:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:45,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 20:39:45,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 205 proven. 217 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-19 20:39:46,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:46,217 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-19 20:39:46,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 14 [2024-11-19 20:39:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 316 proven. 84 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-19 20:39:46,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705560719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:46,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:46,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 14] total 44 [2024-11-19 20:39:46,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903894054] [2024-11-19 20:39:46,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:46,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 20:39:46,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:46,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 20:39:46,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1642, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 20:39:46,300 INFO L87 Difference]: Start difference. First operand 5565 states and 7059 transitions. Second operand has 44 states, 44 states have (on average 3.522727272727273) internal successors, (155), 44 states have internal predecessors, (155), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:47,843 INFO L93 Difference]: Finished difference Result 10652 states and 13601 transitions. [2024-11-19 20:39:47,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-19 20:39:47,844 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 3.522727272727273) internal successors, (155), 44 states have internal predecessors, (155), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:47,863 INFO L225 Difference]: With dead ends: 10652 [2024-11-19 20:39:47,863 INFO L226 Difference]: Without dead ends: 8411 [2024-11-19 20:39:47,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=698, Invalid=4272, Unknown=0, NotChecked=0, Total=4970 [2024-11-19 20:39:47,869 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 184 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1714 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:47,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 679 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1714 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 20:39:47,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2024-11-19 20:39:48,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 5861. [2024-11-19 20:39:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5861 states, 5855 states have (on average 1.2739538855678907) internal successors, (7459), 5855 states have internal predecessors, (7459), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5861 states to 5861 states and 7467 transitions. [2024-11-19 20:39:48,462 INFO L78 Accepts]: Start accepts. Automaton has 5861 states and 7467 transitions. Word has length 107 [2024-11-19 20:39:48,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:48,462 INFO L471 AbstractCegarLoop]: Abstraction has 5861 states and 7467 transitions. [2024-11-19 20:39:48,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 3.522727272727273) internal successors, (155), 44 states have internal predecessors, (155), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5861 states and 7467 transitions. [2024-11-19 20:39:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:48,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:48,474 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:48,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 20:39:48,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 20:39:48,679 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:48,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:48,679 INFO L85 PathProgramCache]: Analyzing trace with hash 587052972, now seen corresponding path program 8 times [2024-11-19 20:39:48,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:48,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023576894] [2024-11-19 20:39:48,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:48,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:49,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:49,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:49,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 385 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-19 20:39:49,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023576894] [2024-11-19 20:39:49,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023576894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:49,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917111032] [2024-11-19 20:39:49,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:39:49,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:49,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:49,131 INFO L229 MonitoredProcess]: Starting monitored process 12 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:49,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 20:39:49,252 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:39:49,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:49,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 20:39:49,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:49,525 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 202 proven. 28 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-19 20:39:49,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:49,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:49,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2024-11-19 20:39:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 202 proven. 28 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2024-11-19 20:39:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917111032] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:49,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:49,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 32 [2024-11-19 20:39:49,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771123067] [2024-11-19 20:39:49,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:49,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 20:39:49,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 20:39:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2024-11-19 20:39:49,787 INFO L87 Difference]: Start difference. First operand 5861 states and 7467 transitions. Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:52,285 INFO L93 Difference]: Finished difference Result 13963 states and 17858 transitions. [2024-11-19 20:39:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-11-19 20:39:52,286 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:52,308 INFO L225 Difference]: With dead ends: 13963 [2024-11-19 20:39:52,308 INFO L226 Difference]: Without dead ends: 10379 [2024-11-19 20:39:52,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1966 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=6474, Unknown=0, NotChecked=0, Total=7140 [2024-11-19 20:39:52,317 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 199 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 20:39:52,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 733 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 20:39:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2024-11-19 20:39:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 7039. [2024-11-19 20:39:53,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7039 states, 7033 states have (on average 1.2702971704820134) internal successors, (8934), 7033 states have internal predecessors, (8934), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:39:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7039 states to 7039 states and 8942 transitions. [2024-11-19 20:39:53,096 INFO L78 Accepts]: Start accepts. Automaton has 7039 states and 8942 transitions. Word has length 107 [2024-11-19 20:39:53,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:39:53,097 INFO L471 AbstractCegarLoop]: Abstraction has 7039 states and 8942 transitions. [2024-11-19 20:39:53,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:53,097 INFO L276 IsEmpty]: Start isEmpty. Operand 7039 states and 8942 transitions. [2024-11-19 20:39:53,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:39:53,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:39:53,109 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:53,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-19 20:39:53,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:53,313 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:39:53,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:39:53,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1588154776, now seen corresponding path program 9 times [2024-11-19 20:39:53,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:39:53,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929676259] [2024-11-19 20:39:53,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:39:53,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:39:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:39:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:39:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:39:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:39:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:39:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 7 proven. 385 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-19 20:39:53,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:39:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929676259] [2024-11-19 20:39:53,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929676259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:39:53,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73584924] [2024-11-19 20:39:53,851 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 20:39:53,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:39:53,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:39:53,854 INFO L229 MonitoredProcess]: Starting monitored process 13 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:53,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 20:39:53,971 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-11-19 20:39:53,972 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:39:53,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 20:39:53,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:39:54,409 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:39:54,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 26 [2024-11-19 20:39:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 155 proven. 101 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2024-11-19 20:39:54,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:39:54,837 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 184 proven. 21 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2024-11-19 20:39:54,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73584924] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:39:54,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:39:54,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 36 [2024-11-19 20:39:54,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027896757] [2024-11-19 20:39:54,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:39:54,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-19 20:39:54,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:39:54,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-19 20:39:54,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 20:39:54,839 INFO L87 Difference]: Start difference. First operand 7039 states and 8942 transitions. Second operand has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:39:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:39:59,951 INFO L93 Difference]: Finished difference Result 20564 states and 26132 transitions. [2024-11-19 20:39:59,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2024-11-19 20:39:59,952 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:39:59,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:39:59,989 INFO L225 Difference]: With dead ends: 20564 [2024-11-19 20:39:59,989 INFO L226 Difference]: Without dead ends: 17291 [2024-11-19 20:40:00,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8194 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4153, Invalid=18497, Unknown=0, NotChecked=0, Total=22650 [2024-11-19 20:40:00,002 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 227 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 20:40:00,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 457 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 20:40:00,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17291 states. [2024-11-19 20:40:01,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17291 to 11905. [2024-11-19 20:40:01,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11905 states, 11899 states have (on average 1.2733002773342297) internal successors, (15151), 11899 states have internal predecessors, (15151), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:40:01,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11905 states to 11905 states and 15159 transitions. [2024-11-19 20:40:01,668 INFO L78 Accepts]: Start accepts. Automaton has 11905 states and 15159 transitions. Word has length 107 [2024-11-19 20:40:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:40:01,669 INFO L471 AbstractCegarLoop]: Abstraction has 11905 states and 15159 transitions. [2024-11-19 20:40:01,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.3333333333333335) internal successors, (120), 36 states have internal predecessors, (120), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:40:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 11905 states and 15159 transitions. [2024-11-19 20:40:01,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:40:01,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:40:01,685 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:40:01,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 20:40:01,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:40:01,890 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:40:01,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:40:01,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1439325936, now seen corresponding path program 10 times [2024-11-19 20:40:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:40:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881178876] [2024-11-19 20:40:01,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:40:01,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:40:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:40:02,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 20:40:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:40:02,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 20:40:02,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:40:02,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 20:40:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:40:02,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:40:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:40:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 250 proven. 83 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-19 20:40:02,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:40:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881178876] [2024-11-19 20:40:02,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881178876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:40:02,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101787645] [2024-11-19 20:40:02,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-19 20:40:02,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:40:02,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:40:02,209 INFO L229 MonitoredProcess]: Starting monitored process 14 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:40:02,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 20:40:02,321 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-19 20:40:02,321 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:40:02,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-19 20:40:02,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:40:02,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:40:02,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 28 [2024-11-19 20:40:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 8 proven. 402 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 20:40:02,932 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:40:03,472 INFO L349 Elim1Store]: treesize reduction 18, result has 45.5 percent of original size [2024-11-19 20:40:03,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 30 [2024-11-19 20:40:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 9 proven. 401 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-19 20:40:03,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101787645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:40:03,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:40:03,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 21, 21] total 47 [2024-11-19 20:40:03,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157378230] [2024-11-19 20:40:03,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:40:03,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-19 20:40:03,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:40:03,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-19 20:40:03,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1806, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 20:40:03,545 INFO L87 Difference]: Start difference. First operand 11905 states and 15159 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:40:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:40:19,225 INFO L93 Difference]: Finished difference Result 37414 states and 47674 transitions. [2024-11-19 20:40:19,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 308 states. [2024-11-19 20:40:19,226 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 107 [2024-11-19 20:40:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:40:19,279 INFO L225 Difference]: With dead ends: 37414 [2024-11-19 20:40:19,279 INFO L226 Difference]: Without dead ends: 32878 [2024-11-19 20:40:19,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 188 SyntacticMatches, 1 SemanticMatches, 340 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50880 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=13172, Invalid=103450, Unknown=0, NotChecked=0, Total=116622 [2024-11-19 20:40:19,298 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 772 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:40:19,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 638 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 20:40:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32878 states. [2024-11-19 20:40:22,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32878 to 21456. [2024-11-19 20:40:22,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21456 states, 21450 states have (on average 1.2805594405594405) internal successors, (27468), 21450 states have internal predecessors, (27468), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-19 20:40:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21456 states to 21456 states and 27476 transitions. [2024-11-19 20:40:22,712 INFO L78 Accepts]: Start accepts. Automaton has 21456 states and 27476 transitions. Word has length 107 [2024-11-19 20:40:22,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:40:22,712 INFO L471 AbstractCegarLoop]: Abstraction has 21456 states and 27476 transitions. [2024-11-19 20:40:22,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 20:40:22,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21456 states and 27476 transitions. [2024-11-19 20:40:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 20:40:22,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:40:22,738 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 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:40:22,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-19 20:40:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-19 20:40:22,942 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:40:22,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:40:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1030632236, now seen corresponding path program 11 times [2024-11-19 20:40:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:40:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57338321] [2024-11-19 20:40:22,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:40:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:40:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:40:22,961 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 20:40:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:40:23,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 20:40:23,007 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 20:40:23,008 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:40:23,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 20:40:23,013 INFO L407 BasicCegarLoop]: Path program histogram: [11, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:40:23,079 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:40:23,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:40:23 BoogieIcfgContainer [2024-11-19 20:40:23,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 20:40:23,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 20:40:23,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 20:40:23,085 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 20:40:23,085 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:08" (3/4) ... [2024-11-19 20:40:23,086 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 20:40:23,157 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 20:40:23,158 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 20:40:23,158 INFO L158 Benchmark]: Toolchain (without parser) took 75237.51ms. Allocated memory was 190.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 125.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-19 20:40:23,158 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:40:23,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.70ms. Allocated memory is still 190.8MB. Free memory was 125.0MB in the beginning and 112.2MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 20:40:23,159 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.36ms. Allocated memory is still 190.8MB. Free memory was 112.0MB in the beginning and 110.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:40:23,159 INFO L158 Benchmark]: Boogie Preprocessor took 63.16ms. Allocated memory is still 190.8MB. Free memory was 110.1MB in the beginning and 163.6MB in the end (delta: -53.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-19 20:40:23,159 INFO L158 Benchmark]: RCFGBuilder took 355.88ms. Allocated memory is still 190.8MB. Free memory was 163.6MB in the beginning and 148.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 20:40:23,159 INFO L158 Benchmark]: TraceAbstraction took 74381.90ms. Allocated memory was 190.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 147.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-19 20:40:23,160 INFO L158 Benchmark]: Witness Printer took 73.64ms. Allocated memory is still 2.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:40:23,161 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.15ms. Allocated memory is still 117.4MB. Free memory is still 80.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.70ms. Allocated memory is still 190.8MB. Free memory was 125.0MB in the beginning and 112.2MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.36ms. Allocated memory is still 190.8MB. Free memory was 112.0MB in the beginning and 110.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.16ms. Allocated memory is still 190.8MB. Free memory was 110.1MB in the beginning and 163.6MB in the end (delta: -53.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * RCFGBuilder took 355.88ms. Allocated memory is still 190.8MB. Free memory was 163.6MB in the beginning and 148.1MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 74381.90ms. Allocated memory was 190.8MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 147.3MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 73.64ms. Allocated memory is still 2.8GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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: [L56] int x, y, z, w; [L57] x = __VERIFIER_nondet_int() [L58] y = __VERIFIER_nondet_int() [L59] z = __VERIFIER_nondet_int() [L60] w = __VERIFIER_nondet_int() [L61] CALL, EXPR solve(x, y, z, w) [L44] CALL, EXPR check_domain(s0) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s0) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s1) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L44] RET, EXPR check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] CALL, EXPR check_domain(s2) VAL [\old(x)=2] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=2, \result=1] [L44] RET, EXPR check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44] EXPR check_domain(s0) && check_domain(s1) && check_domain(s2) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L45] CALL, EXPR check_domain(s3) VAL [\old(x)=0] [L28] COND TRUE x >= 0 && x <= 4 [L28] return 1; VAL [\old(x)=0, \result=1] [L45] RET, EXPR check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) VAL [s0=2, s1=0, s2=2, s3=0] [L44-L45] COND TRUE check_domain(s0) && check_domain(s1) && check_domain(s2) && check_domain(s3) [L46] CALL check_sum(s0, s1, s2, s3) [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L33] int s[4] = {s0, s1, s2, s3}; [L34] int i = 0; VAL [i=0, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=0, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=1, s={5:0}, sum=1] [L36] j++ VAL [i=0, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=0, j=3, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=0, j=3, s={5:0}, sum=2] [L36] j++ VAL [i=0, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=0, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=1, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=1, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=1, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=1, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=2, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=2, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=0, s={5:0}, sum=1] [L36] j++ VAL [i=2, j=1, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=2, s={5:0}, sum=1] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND TRUE s[j] == i [L37] sum++ VAL [i=2, j=2, s={5:0}, sum=2] [L36] j++ VAL [i=2, j=3, s={5:0}, sum=2] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=2, j=4, s={5:0}, sum=2] [L36] COND FALSE !(j < 4) VAL [i=2, s={5:0}, sum=2] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=3, s={5:0}] [L34] COND TRUE i < 4 [L35] int sum = 0; [L36] int j = 0; VAL [i=3, j=0, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=1, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=2, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=3, s={5:0}, sum=0] [L36] COND TRUE j < 4 [L37] EXPR s[j] [L37] COND FALSE !(s[j] == i) [L36] j++ VAL [i=3, j=4, s={5:0}, sum=0] [L36] COND FALSE !(j < 4) VAL [i=3, s={5:0}, sum=0] [L38] EXPR s[i] [L38] COND FALSE !(sum != s[i]) [L34] i++ VAL [i=4, s={5:0}] [L34] COND FALSE !(i < 4) VAL [s={5:0}] [L40] return 1; [L33] int s[4] = {s0, s1, s2, s3}; [L40] return 1; VAL [\result=1] [L46] RET check_sum(s0, s1, s2, s3) [L46] COND TRUE check_sum(s0, s1, s2, s3) [L47] return 1; VAL [\result=1] [L61] RET, EXPR solve(x, y, z, w) [L61] CALL __VERIFIER_assert(!solve(x, y, z, w)) [L18] COND TRUE !(cond) [L20] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.2s, OverallIterations: 22, TraceHistogramMax: 16, PathProgramHistogramMax: 11, EmptinessCheckTime: 0.1s, AutomataDifference: 44.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3423 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3423 mSDsluCounter, 8171 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7322 mSDsCounter, 440 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17220 IncrementalHoareTripleChecker+Invalid, 17660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 440 mSolverCounterUnsat, 849 mSDtfsCounter, 17220 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4120 GetRequests, 2570 SyntacticMatches, 7 SemanticMatches, 1543 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112119 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21456occurred in iteration=21, InterpolantAutomatonStates: 1368, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 32081 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 2909 NumberOfCodeBlocks, 2820 NumberOfCodeBlocksAsserted, 93 NumberOfCheckSat, 4032 ConstructedInterpolants, 1 QuantifiedInterpolants, 20071 SizeOfPredicates, 89 NumberOfNonLiveVariables, 3968 ConjunctsInSsa, 383 ConjunctsInUnsatCore, 47 InterpolantComputations, 8 PerfectInterpolantSequences, 10486/16232 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:40:23,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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