./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-nonlinear/color-magicseries2.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 f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 13:47:13,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:47:13,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:47:13,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:47:13,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:47:13,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:47:13,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:47:13,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:47:13,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:47:13,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:47:13,816 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:47:13,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:47:13,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:47:13,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:47:13,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:47:13,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:47:13,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:47:13,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:47:13,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:47:13,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:47:13,819 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:47:13,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:47:13,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:47:13,820 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:47:13,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:47:13,821 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:47:13,821 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:47:13,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:47:13,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:47:13,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:47:13,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:47:13,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:47:13,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:13,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:47:13,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:47:13,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:47:13,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:47:13,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:47:13,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:47:13,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:47:13,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:47:13,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:47:13,826 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 -> f056be744fcae26accb2c049a9cf7a4321bd3ba6c0302870967f442303a6d9cc [2024-11-08 13:47:14,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:47:14,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:47:14,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:47:14,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:47:14,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:47:14,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-nonlinear/color-magicseries2.c [2024-11-08 13:47:15,602 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:47:15,803 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:47:15,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-nonlinear/color-magicseries2.c [2024-11-08 13:47:15,818 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cc25cce/5c85412ccc6840e289f175ec04175f99/FLAG75acb5eb0 [2024-11-08 13:47:16,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81cc25cce/5c85412ccc6840e289f175ec04175f99 [2024-11-08 13:47:16,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:47:16,177 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:47:16,178 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:16,178 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:47:16,186 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:47:16,187 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79cc59ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16, skipping insertion in model container [2024-11-08 13:47:16,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:47:16,398 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-magicseries2.c[613,626] [2024-11-08 13:47:16,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:16,440 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:47:16,453 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-magicseries2.c[613,626] [2024-11-08 13:47:16,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:47:16,489 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:47:16,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16 WrapperNode [2024-11-08 13:47:16,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:47:16,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:16,492 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:47:16,492 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:47:16,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,542 INFO L138 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2024-11-08 13:47:16,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:47:16,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:47:16,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:47:16,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:47:16,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,559 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,575 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-08 13:47:16,576 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,577 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,587 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,594 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:47:16,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:47:16,602 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:47:16,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:47:16,603 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (1/1) ... [2024-11-08 13:47:16,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:47:16,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:16,633 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-08 13:47:16,637 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-08 13:47:16,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:47:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:47:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:47:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 13:47:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-08 13:47:16,690 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-08 13:47:16,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:47:16,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:47:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 13:47:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 13:47:16,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:47:16,811 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:47:16,813 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:47:17,017 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-08 13:47:17,017 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:47:17,029 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:47:17,030 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 13:47:17,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:17 BoogieIcfgContainer [2024-11-08 13:47:17,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:47:17,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:47:17,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:47:17,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:47:17,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:47:16" (1/3) ... [2024-11-08 13:47:17,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eea791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:17, skipping insertion in model container [2024-11-08 13:47:17,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:47:16" (2/3) ... [2024-11-08 13:47:17,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3eea791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:47:17, skipping insertion in model container [2024-11-08 13:47:17,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:17" (3/3) ... [2024-11-08 13:47:17,037 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries2.c [2024-11-08 13:47:17,051 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:47:17,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 13:47:17,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:47:17,117 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;@7c724c12, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:47:17,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 13:47:17,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 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-08 13:47:17,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:47:17,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:17,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:17,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:17,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:17,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1909413201, now seen corresponding path program 1 times [2024-11-08 13:47:17,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:17,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908584997] [2024-11-08 13:47:17,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,486 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-08 13:47:17,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908584997] [2024-11-08 13:47:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908584997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:47:17,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329320274] [2024-11-08 13:47:17,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:17,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 13:47:17,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 13:47:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:47:17,515 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 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) 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-08 13:47:17,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:17,574 INFO L93 Difference]: Finished difference Result 75 states and 108 transitions. [2024-11-08 13:47:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 13:47:17,576 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-08 13:47:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:17,584 INFO L225 Difference]: With dead ends: 75 [2024-11-08 13:47:17,584 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:17,587 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-08 13:47:17,591 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 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-08 13:47:17,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-08 13:47:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-08 13:47:17,625 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2024-11-08 13:47:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:17,626 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-08 13:47:17,626 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-08 13:47:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-08 13:47:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 13:47:17,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:17,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:17,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:47:17,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:17,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:17,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2092151088, now seen corresponding path program 1 times [2024-11-08 13:47:17,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:17,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519453267] [2024-11-08 13:47:17,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:17,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,735 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-08 13:47:17,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:17,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519453267] [2024-11-08 13:47:17,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519453267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:17,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:17,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:17,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204771891] [2024-11-08 13:47:17,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:17,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:17,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:17,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:17,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:17,744 INFO L87 Difference]: Start difference. First operand 39 states and 55 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-08 13:47:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:17,765 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-11-08 13:47:17,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:17,766 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-08 13:47:17,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:17,767 INFO L225 Difference]: With dead ends: 43 [2024-11-08 13:47:17,768 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:17,769 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-08 13:47:17,770 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 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-08 13:47:17,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:17,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 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-08 13:47:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-08 13:47:17,784 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 17 [2024-11-08 13:47:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-08 13:47:17,784 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-08 13:47:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-08 13:47:17,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-08 13:47:17,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:17,787 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:17,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:47:17,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:17,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1014348991, now seen corresponding path program 1 times [2024-11-08 13:47:17,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:17,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167285302] [2024-11-08 13:47:17,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:17,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,846 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-08 13:47:17,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:17,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167285302] [2024-11-08 13:47:17,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167285302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:17,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:17,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:17,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62885665] [2024-11-08 13:47:17,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:17,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:17,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:17,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:17,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:17,850 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 13:47:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:17,868 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-08 13:47:17,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:17,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2024-11-08 13:47:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:17,871 INFO L225 Difference]: With dead ends: 55 [2024-11-08 13:47:17,871 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:17,872 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-08 13:47:17,874 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 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-08 13:47:17,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:17,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:17,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 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-08 13:47:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2024-11-08 13:47:17,888 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 19 [2024-11-08 13:47:17,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:17,889 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2024-11-08 13:47:17,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-08 13:47:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2024-11-08 13:47:17,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-08 13:47:17,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:17,892 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] [2024-11-08 13:47:17,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:47:17,892 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:17,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:17,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1993641799, now seen corresponding path program 1 times [2024-11-08 13:47:17,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:17,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570675654] [2024-11-08 13:47:17,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:17,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:17,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-08 13:47:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,001 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-08 13:47:18,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570675654] [2024-11-08 13:47:18,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570675654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:18,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:18,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:18,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272576562] [2024-11-08 13:47:18,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:18,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:18,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:18,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:18,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:18,005 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-08 13:47:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:18,041 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2024-11-08 13:47:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:18,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 25 [2024-11-08 13:47:18,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:18,043 INFO L225 Difference]: With dead ends: 65 [2024-11-08 13:47:18,043 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:18,043 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-08 13:47:18,045 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 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-08 13:47:18,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:18,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:18,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-08 13:47:18,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 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-08 13:47:18,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-11-08 13:47:18,061 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 25 [2024-11-08 13:47:18,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:18,061 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-11-08 13:47:18,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-08 13:47:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-11-08 13:47:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 13:47:18,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,063 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] [2024-11-08 13:47:18,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 13:47:18,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:18,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:18,064 INFO L85 PathProgramCache]: Analyzing trace with hash 719872684, now seen corresponding path program 1 times [2024-11-08 13:47:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:18,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837338416] [2024-11-08 13:47:18,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:47:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 13:47:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,170 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-08 13:47:18,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:18,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837338416] [2024-11-08 13:47:18,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837338416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:18,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:18,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880687669] [2024-11-08 13:47:18,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:18,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:18,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:18,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:18,174 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08 13:47:18,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:18,206 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2024-11-08 13:47:18,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:18,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 31 [2024-11-08 13:47:18,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:18,210 INFO L225 Difference]: With dead ends: 69 [2024-11-08 13:47:18,210 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:18,211 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-08 13:47:18,212 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:18,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:18,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-08 13:47:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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-08 13:47:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-11-08 13:47:18,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 31 [2024-11-08 13:47:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:18,218 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-11-08 13:47:18,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-08 13:47:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-11-08 13:47:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 13:47:18,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,219 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] [2024-11-08 13:47:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:47:18,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:18,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:18,222 INFO L85 PathProgramCache]: Analyzing trace with hash 683802393, now seen corresponding path program 1 times [2024-11-08 13:47:18,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:18,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692560185] [2024-11-08 13:47:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,300 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-08 13:47:18,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:18,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692560185] [2024-11-08 13:47:18,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692560185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:18,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:18,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:18,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650389621] [2024-11-08 13:47:18,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:18,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:18,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:18,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:18,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:18,304 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 13:47:18,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:18,321 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-08 13:47:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 37 [2024-11-08 13:47:18,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:18,324 INFO L225 Difference]: With dead ends: 40 [2024-11-08 13:47:18,324 INFO L226 Difference]: Without dead ends: 35 [2024-11-08 13:47:18,325 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-08 13:47:18,326 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 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-08 13:47:18,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-08 13:47:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-08 13:47:18,334 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-08 13:47:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-11-08 13:47:18,335 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 37 [2024-11-08 13:47:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:18,335 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-11-08 13:47:18,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-08 13:47:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-11-08 13:47:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 13:47:18,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,337 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] [2024-11-08 13:47:18,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 13:47:18,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:18,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689165, now seen corresponding path program 1 times [2024-11-08 13:47:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947877334] [2024-11-08 13:47:18,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,402 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-08 13:47:18,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:18,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947877334] [2024-11-08 13:47:18,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947877334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:18,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:18,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:18,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165716413] [2024-11-08 13:47:18,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:18,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:18,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:18,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:18,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:18,404 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 13:47:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:18,423 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-11-08 13:47:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:18,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 40 [2024-11-08 13:47:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:18,424 INFO L225 Difference]: With dead ends: 50 [2024-11-08 13:47:18,424 INFO L226 Difference]: Without dead ends: 43 [2024-11-08 13:47:18,425 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-08 13:47:18,426 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 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-08 13:47:18,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-08 13:47:18,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2024-11-08 13:47:18,430 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-08 13:47:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-08 13:47:18,430 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 40 [2024-11-08 13:47:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:18,431 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-08 13:47:18,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-08 13:47:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-08 13:47:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-08 13:47:18,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,432 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] [2024-11-08 13:47:18,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 13:47:18,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:18,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 35157834, now seen corresponding path program 1 times [2024-11-08 13:47:18,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736742535] [2024-11-08 13:47:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:18,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,501 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-08 13:47:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736742535] [2024-11-08 13:47:18,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736742535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:18,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:18,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 13:47:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299681744] [2024-11-08 13:47:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:18,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 13:47:18,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 13:47:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 13:47:18,503 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-08 13:47:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:18,516 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2024-11-08 13:47:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 13:47:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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 42 [2024-11-08 13:47:18,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:18,517 INFO L225 Difference]: With dead ends: 53 [2024-11-08 13:47:18,517 INFO L226 Difference]: Without dead ends: 39 [2024-11-08 13:47:18,518 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-08 13:47:18,519 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 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-08 13:47:18,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:18,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-08 13:47:18,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-08 13:47:18,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-08 13:47:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-08 13:47:18,528 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 42 [2024-11-08 13:47:18,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:18,529 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-08 13:47:18,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (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-08 13:47:18,529 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-08 13:47:18,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-08 13:47:18,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,530 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, 1] [2024-11-08 13:47:18,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 13:47:18,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:18,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:18,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1234560462, now seen corresponding path program 1 times [2024-11-08 13:47:18,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:18,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362772105] [2024-11-08 13:47:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,619 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-08 13:47:18,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:18,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362772105] [2024-11-08 13:47:18,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362772105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:18,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555592084] [2024-11-08 13:47:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:18,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:18,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:18,623 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-08 13:47:18,625 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-08 13:47:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:18,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 13:47:18,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:18,796 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-08 13:47:18,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:18,849 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-08 13:47:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555592084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:18,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 13:47:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888689537] [2024-11-08 13:47:18,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:18,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:47:18,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:18,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:47:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:47:18,851 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 13:47:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:18,881 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-11-08 13:47:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:47:18,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 45 [2024-11-08 13:47:18,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:18,883 INFO L225 Difference]: With dead ends: 61 [2024-11-08 13:47:18,883 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 13:47:18,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 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-08 13:47:18,885 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:18,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 13:47:18,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 13:47:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 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-08 13:47:18,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-08 13:47:18,892 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 45 [2024-11-08 13:47:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-08 13:47:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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-08 13:47:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-08 13:47:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-08 13:47:18,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:18,902 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] [2024-11-08 13:47:18,916 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-08 13:47:19,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:19,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,105 INFO L85 PathProgramCache]: Analyzing trace with hash 657433930, now seen corresponding path program 2 times [2024-11-08 13:47:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034352965] [2024-11-08 13:47:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,219 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-08 13:47:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034352965] [2024-11-08 13:47:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034352965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:47:19,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:47:19,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:47:19,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589486775] [2024-11-08 13:47:19,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:47:19,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:47:19,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:19,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:47:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:47:19,221 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-08 13:47:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:19,242 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2024-11-08 13:47:19,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:47:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 54 [2024-11-08 13:47:19,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:19,243 INFO L225 Difference]: With dead ends: 52 [2024-11-08 13:47:19,243 INFO L226 Difference]: Without dead ends: 46 [2024-11-08 13:47:19,244 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-08 13:47:19,244 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:19,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:19,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-08 13:47:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-08 13:47:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.175) internal successors, (47), 40 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-08 13:47:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2024-11-08 13:47:19,254 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 54 [2024-11-08 13:47:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2024-11-08 13:47:19,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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-08 13:47:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2024-11-08 13:47:19,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 13:47:19,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:19,257 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, 1] [2024-11-08 13:47:19,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 13:47:19,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2116133056, now seen corresponding path program 1 times [2024-11-08 13:47:19,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654425924] [2024-11-08 13:47:19,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,370 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-08 13:47:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654425924] [2024-11-08 13:47:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654425924] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929021467] [2024-11-08 13:47:19,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:19,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:19,373 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-08 13:47:19,375 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-08 13:47:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:19,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 13:47:19,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:19,509 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-08 13:47:19,509 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:19,580 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-08 13:47:19,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929021467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:19,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:19,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-08 13:47:19,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358903632] [2024-11-08 13:47:19,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:19,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 13:47:19,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 13:47:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-08 13:47:19,583 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-08 13:47:19,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:19,623 INFO L93 Difference]: Finished difference Result 104 states and 130 transitions. [2024-11-08 13:47:19,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:47:19,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 57 [2024-11-08 13:47:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:19,625 INFO L225 Difference]: With dead ends: 104 [2024-11-08 13:47:19,626 INFO L226 Difference]: Without dead ends: 97 [2024-11-08 13:47:19,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 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-08 13:47:19,627 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:19,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 132 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:47:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-08 13:47:19,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-08 13:47:19,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 91 states have internal predecessors, (113), 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-08 13:47:19,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 121 transitions. [2024-11-08 13:47:19,639 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 121 transitions. Word has length 57 [2024-11-08 13:47:19,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:19,639 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 121 transitions. [2024-11-08 13:47:19,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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-08 13:47:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2024-11-08 13:47:19,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:19,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:19,641 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, 1] [2024-11-08 13:47:19,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 13:47:19,841 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,SelfDestructingSolverStorable10 [2024-11-08 13:47:19,842 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:19,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:19,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2022113907, now seen corresponding path program 2 times [2024-11-08 13:47:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626147354] [2024-11-08 13:47:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:20,854 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 88 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-08 13:47:20,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626147354] [2024-11-08 13:47:20,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626147354] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:20,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642220733] [2024-11-08 13:47:20,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:47:20,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:20,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:20,857 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-08 13:47:20,858 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-08 13:47:20,988 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:47:20,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:20,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 13:47:20,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 181 proven. 22 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-08 13:47:21,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:21,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:47:21,588 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-08 13:47:21,660 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 181 proven. 22 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2024-11-08 13:47:21,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642220733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:21,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:21,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 10, 10] total 33 [2024-11-08 13:47:21,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759783880] [2024-11-08 13:47:21,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:21,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-08 13:47:21,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:21,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-08 13:47:21,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 13:47:21,664 INFO L87 Difference]: Start difference. First operand 97 states and 121 transitions. Second operand has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 13:47:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:24,064 INFO L93 Difference]: Finished difference Result 302 states and 393 transitions. [2024-11-08 13:47:24,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-08 13:47:24,065 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 108 [2024-11-08 13:47:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:24,066 INFO L225 Difference]: With dead ends: 302 [2024-11-08 13:47:24,066 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 13:47:24,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1022, Invalid=6634, Unknown=0, NotChecked=0, Total=7656 [2024-11-08 13:47:24,070 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 203 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:24,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 607 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 13:47:24,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 13:47:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 185. [2024-11-08 13:47:24,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 179 states have (on average 1.2849162011173185) internal successors, (230), 179 states have internal predecessors, (230), 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-08 13:47:24,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 238 transitions. [2024-11-08 13:47:24,097 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 238 transitions. Word has length 108 [2024-11-08 13:47:24,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:24,097 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 238 transitions. [2024-11-08 13:47:24,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.909090909090909) internal successors, (96), 32 states have internal predecessors, (96), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-08 13:47:24,097 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 238 transitions. [2024-11-08 13:47:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:24,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:24,098 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 14, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:47:24,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-08 13:47:24,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:24,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:24,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -242017033, now seen corresponding path program 1 times [2024-11-08 13:47:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467649050] [2024-11-08 13:47:24,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:24,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,144 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 214 proven. 178 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-08 13:47:25,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467649050] [2024-11-08 13:47:25,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467649050] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:25,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978914245] [2024-11-08 13:47:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:25,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:25,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:25,147 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-08 13:47:25,148 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-08 13:47:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:25,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-08 13:47:25,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 187 proven. 240 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 13:47:25,978 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:26,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:47:26,249 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 26 treesize of output 19 [2024-11-08 13:47:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 188 proven. 222 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-08 13:47:26,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978914245] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:26,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:26,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 49 [2024-11-08 13:47:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167911110] [2024-11-08 13:47:26,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:26,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-08 13:47:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 13:47:26,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2159, Unknown=0, NotChecked=0, Total=2352 [2024-11-08 13:47:26,424 INFO L87 Difference]: Start difference. First operand 185 states and 238 transitions. Second operand has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 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-08 13:47:39,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:39,942 INFO L93 Difference]: Finished difference Result 1215 states and 1578 transitions. [2024-11-08 13:47:39,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 412 states. [2024-11-08 13:47:39,943 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 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 108 [2024-11-08 13:47:39,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:39,950 INFO L225 Difference]: With dead ends: 1215 [2024-11-08 13:47:39,953 INFO L226 Difference]: Without dead ends: 1092 [2024-11-08 13:47:39,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82299 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=9337, Invalid=180323, Unknown=0, NotChecked=0, Total=189660 [2024-11-08 13:47:39,980 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1339 mSDsluCounter, 931 mSDsCounter, 0 mSdLazyCounter, 6119 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1339 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 6172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 6119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:39,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1339 Valid, 985 Invalid, 6172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 6119 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-08 13:47:39,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1092 states. [2024-11-08 13:47:40,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1092 to 850. [2024-11-08 13:47:40,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 850 states, 844 states have (on average 1.3151658767772512) internal successors, (1110), 844 states have internal predecessors, (1110), 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-08 13:47:40,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1118 transitions. [2024-11-08 13:47:40,034 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1118 transitions. Word has length 108 [2024-11-08 13:47:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:40,034 INFO L471 AbstractCegarLoop]: Abstraction has 850 states and 1118 transitions. [2024-11-08 13:47:40,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.142857142857143) internal successors, (154), 49 states have internal predecessors, (154), 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-08 13:47:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1118 transitions. [2024-11-08 13:47:40,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:40,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:40,038 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, 1] [2024-11-08 13:47:40,055 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-08 13:47:40,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:40,242 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:40,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1272944137, now seen corresponding path program 2 times [2024-11-08 13:47:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:40,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108586925] [2024-11-08 13:47:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:40,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:40,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:40,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 10 proven. 402 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-08 13:47:40,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108586925] [2024-11-08 13:47:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108586925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447275963] [2024-11-08 13:47:40,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 13:47:40,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:40,932 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-08 13:47:40,933 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-08 13:47:41,052 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 13:47:41,052 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:41,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 13:47:41,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:41,378 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 90 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-08 13:47:41,378 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:41,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:47:41,547 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-08 13:47:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 245 proven. 80 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-08 13:47:41,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447275963] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:41,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:41,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 11] total 35 [2024-11-08 13:47:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708005241] [2024-11-08 13:47:41,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:41,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-08 13:47:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-08 13:47:41,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 13:47:41,703 INFO L87 Difference]: Start difference. First operand 850 states and 1118 transitions. Second operand has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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-08 13:47:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:43,535 INFO L93 Difference]: Finished difference Result 2152 states and 2857 transitions. [2024-11-08 13:47:43,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-08 13:47:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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 108 [2024-11-08 13:47:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:43,543 INFO L225 Difference]: With dead ends: 2152 [2024-11-08 13:47:43,543 INFO L226 Difference]: Without dead ends: 1534 [2024-11-08 13:47:43,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2168 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=6607, Unknown=0, NotChecked=0, Total=7310 [2024-11-08 13:47:43,547 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 142 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1866 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:43,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 762 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1866 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 13:47:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2024-11-08 13:47:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1262. [2024-11-08 13:47:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1256 states have (on average 1.3176751592356688) internal successors, (1655), 1256 states have internal predecessors, (1655), 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-08 13:47:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1663 transitions. [2024-11-08 13:47:43,630 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1663 transitions. Word has length 108 [2024-11-08 13:47:43,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:43,630 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1663 transitions. [2024-11-08 13:47:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.7142857142857144) internal successors, (130), 35 states have internal predecessors, (130), 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-08 13:47:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1663 transitions. [2024-11-08 13:47:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:43,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:43,635 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, 1] [2024-11-08 13:47:43,653 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-08 13:47:43,835 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,SelfDestructingSolverStorable13 [2024-11-08 13:47:43,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:43,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:43,836 INFO L85 PathProgramCache]: Analyzing trace with hash 974766455, now seen corresponding path program 3 times [2024-11-08 13:47:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:43,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747650722] [2024-11-08 13:47:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:44,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:44,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 184 proven. 28 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-08 13:47:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747650722] [2024-11-08 13:47:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747650722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236192840] [2024-11-08 13:47:44,718 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-08 13:47:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:44,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:44,721 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-08 13:47:44,723 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-08 13:47:44,897 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-08 13:47:44,897 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:44,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-08 13:47:44,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:45,221 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 122 proven. 7 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2024-11-08 13:47:45,221 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:45,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:47:45,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 16 [2024-11-08 13:47:45,865 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 89 proven. 210 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-08 13:47:45,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236192840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:45,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:45,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 21] total 43 [2024-11-08 13:47:45,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783511897] [2024-11-08 13:47:45,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:45,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-08 13:47:45,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:45,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-08 13:47:45,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1498, Unknown=0, NotChecked=0, Total=1806 [2024-11-08 13:47:45,868 INFO L87 Difference]: Start difference. First operand 1262 states and 1663 transitions. Second operand has 43 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 13:47:48,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:48,525 INFO L93 Difference]: Finished difference Result 5435 states and 7082 transitions. [2024-11-08 13:47:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-08 13:47:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 108 [2024-11-08 13:47:48,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:48,545 INFO L225 Difference]: With dead ends: 5435 [2024-11-08 13:47:48,545 INFO L226 Difference]: Without dead ends: 4397 [2024-11-08 13:47:48,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2938 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1899, Invalid=9021, Unknown=0, NotChecked=0, Total=10920 [2024-11-08 13:47:48,551 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 276 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:48,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 568 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1101 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 13:47:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4397 states. [2024-11-08 13:47:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4397 to 2154. [2024-11-08 13:47:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2154 states, 2148 states have (on average 1.3435754189944134) internal successors, (2886), 2148 states have internal predecessors, (2886), 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-08 13:47:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2894 transitions. [2024-11-08 13:47:48,798 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2894 transitions. Word has length 108 [2024-11-08 13:47:48,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:48,799 INFO L471 AbstractCegarLoop]: Abstraction has 2154 states and 2894 transitions. [2024-11-08 13:47:48,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.488372093023256) internal successors, (107), 43 states have internal predecessors, (107), 2 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-08 13:47:48,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2894 transitions. [2024-11-08 13:47:48,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:48,805 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:48,805 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 11, 5, 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, 1] [2024-11-08 13:47:48,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 13:47:49,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 13:47:49,007 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:49,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:49,007 INFO L85 PathProgramCache]: Analyzing trace with hash -241387271, now seen corresponding path program 4 times [2024-11-08 13:47:49,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:49,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119424532] [2024-11-08 13:47:49,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:49,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:49,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:49,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:49,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 202 proven. 27 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-08 13:47:49,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:49,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119424532] [2024-11-08 13:47:49,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119424532] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370934373] [2024-11-08 13:47:49,479 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-08 13:47:49,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:49,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:49,481 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-08 13:47:49,482 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-08 13:47:49,583 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-08 13:47:49,583 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:49,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 13:47:49,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:49,671 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 17 treesize of output 9 [2024-11-08 13:47:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 320 proven. 11 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 13:47:49,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:49,776 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 13:47:49,776 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 9 [2024-11-08 13:47:49,790 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 315 proven. 16 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-11-08 13:47:49,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370934373] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:49,791 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:49,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2024-11-08 13:47:49,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140233934] [2024-11-08 13:47:49,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:49,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 13:47:49,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:49,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 13:47:49,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-08 13:47:49,792 INFO L87 Difference]: Start difference. First operand 2154 states and 2894 transitions. Second operand has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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-08 13:47:50,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:50,441 INFO L93 Difference]: Finished difference Result 5535 states and 7592 transitions. [2024-11-08 13:47:50,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 13:47:50,442 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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 108 [2024-11-08 13:47:50,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:50,456 INFO L225 Difference]: With dead ends: 5535 [2024-11-08 13:47:50,456 INFO L226 Difference]: Without dead ends: 3501 [2024-11-08 13:47:50,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=683, Unknown=0, NotChecked=0, Total=812 [2024-11-08 13:47:50,463 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:50,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 444 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:47:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3501 states. [2024-11-08 13:47:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3501 to 2323. [2024-11-08 13:47:50,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2323 states, 2317 states have (on average 1.356063875701338) internal successors, (3142), 2317 states have internal predecessors, (3142), 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-08 13:47:50,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2323 states to 2323 states and 3150 transitions. [2024-11-08 13:47:50,710 INFO L78 Accepts]: Start accepts. Automaton has 2323 states and 3150 transitions. Word has length 108 [2024-11-08 13:47:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:50,710 INFO L471 AbstractCegarLoop]: Abstraction has 2323 states and 3150 transitions. [2024-11-08 13:47:50,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.166666666666667) internal successors, (75), 18 states have internal predecessors, (75), 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-08 13:47:50,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2323 states and 3150 transitions. [2024-11-08 13:47:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:50,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:50,716 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, 1] [2024-11-08 13:47:50,733 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-08 13:47:50,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:50,917 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:50,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash -658940109, now seen corresponding path program 5 times [2024-11-08 13:47:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:50,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965160726] [2024-11-08 13:47:50,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:50,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:51,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:51,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:51,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 248 proven. 80 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-08 13:47:51,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965160726] [2024-11-08 13:47:51,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965160726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:51,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749247170] [2024-11-08 13:47:51,387 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-08 13:47:51,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:51,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:51,390 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-08 13:47:51,391 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-08 13:47:51,484 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2024-11-08 13:47:51,484 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:51,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 13:47:51,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:51,612 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-08 13:47:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 336 proven. 24 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-08 13:47:51,630 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:51,747 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 13:47:51,748 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-08 13:47:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 321 proven. 39 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2024-11-08 13:47:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749247170] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:51,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 10] total 25 [2024-11-08 13:47:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50673044] [2024-11-08 13:47:51,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-08 13:47:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-08 13:47:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2024-11-08 13:47:51,768 INFO L87 Difference]: Start difference. First operand 2323 states and 3150 transitions. Second operand has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 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-08 13:47:52,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:47:52,649 INFO L93 Difference]: Finished difference Result 5627 states and 7642 transitions. [2024-11-08 13:47:52,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-08 13:47:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 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 108 [2024-11-08 13:47:52,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:47:52,663 INFO L225 Difference]: With dead ends: 5627 [2024-11-08 13:47:52,664 INFO L226 Difference]: Without dead ends: 3788 [2024-11-08 13:47:52,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 211 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=1693, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 13:47:52,669 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 57 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 13:47:52,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 441 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 13:47:52,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3788 states. [2024-11-08 13:47:52,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3788 to 2849. [2024-11-08 13:47:52,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2849 states, 2843 states have (on average 1.3373197326767499) internal successors, (3802), 2843 states have internal predecessors, (3802), 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-08 13:47:52,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 3810 transitions. [2024-11-08 13:47:53,001 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 3810 transitions. Word has length 108 [2024-11-08 13:47:53,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:47:53,002 INFO L471 AbstractCegarLoop]: Abstraction has 2849 states and 3810 transitions. [2024-11-08 13:47:53,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.52) internal successors, (88), 25 states have internal predecessors, (88), 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-08 13:47:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 3810 transitions. [2024-11-08 13:47:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:47:53,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:47:53,008 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, 1] [2024-11-08 13:47:53,026 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-08 13:47:53,212 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,SelfDestructingSolverStorable16 [2024-11-08 13:47:53,213 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:47:53,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:47:53,213 INFO L85 PathProgramCache]: Analyzing trace with hash -200712521, now seen corresponding path program 6 times [2024-11-08 13:47:53,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:47:53,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663502336] [2024-11-08 13:47:53,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:47:53,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:47:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:54,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 13:47:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:54,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-08 13:47:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:54,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 13:47:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:54,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:47:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:47:54,027 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 65 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2024-11-08 13:47:54,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:47:54,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663502336] [2024-11-08 13:47:54,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663502336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:47:54,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140131424] [2024-11-08 13:47:54,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-08 13:47:54,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:47:54,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:47:54,030 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-08 13:47:54,032 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-08 13:47:54,147 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2024-11-08 13:47:54,147 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 13:47:54,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-08 13:47:54,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:47:55,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:47:55,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 32 [2024-11-08 13:47:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 247 proven. 73 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-08 13:47:55,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:47:55,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:47:55,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 23 [2024-11-08 13:47:56,282 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 225 proven. 120 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2024-11-08 13:47:56,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140131424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:47:56,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:47:56,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 22] total 54 [2024-11-08 13:47:56,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547028343] [2024-11-08 13:47:56,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:47:56,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-08 13:47:56,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:47:56,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-08 13:47:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2648, Unknown=0, NotChecked=0, Total=2862 [2024-11-08 13:47:56,285 INFO L87 Difference]: Start difference. First operand 2849 states and 3810 transitions. Second operand has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 54 states have internal predecessors, (136), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 13:48:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:48:02,114 INFO L93 Difference]: Finished difference Result 7407 states and 9924 transitions. [2024-11-08 13:48:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-11-08 13:48:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 54 states have internal predecessors, (136), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-08 13:48:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:48:02,132 INFO L225 Difference]: With dead ends: 7407 [2024-11-08 13:48:02,132 INFO L226 Difference]: Without dead ends: 5353 [2024-11-08 13:48:02,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5941 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1403, Invalid=18903, Unknown=0, NotChecked=0, Total=20306 [2024-11-08 13:48:02,139 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 188 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 3433 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 3460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 13:48:02,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1138 Invalid, 3460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3433 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 13:48:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5353 states. [2024-11-08 13:48:02,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5353 to 4152. [2024-11-08 13:48:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4152 states, 4142 states have (on average 1.316030902945437) internal successors, (5451), 4141 states have internal predecessors, (5451), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-08 13:48:02,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4152 states to 4152 states and 5472 transitions. [2024-11-08 13:48:02,688 INFO L78 Accepts]: Start accepts. Automaton has 4152 states and 5472 transitions. Word has length 108 [2024-11-08 13:48:02,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:48:02,688 INFO L471 AbstractCegarLoop]: Abstraction has 4152 states and 5472 transitions. [2024-11-08 13:48:02,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 54 states have internal predecessors, (136), 3 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 13:48:02,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4152 states and 5472 transitions. [2024-11-08 13:48:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-08 13:48:02,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:48:02,698 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, 1] [2024-11-08 13:48:02,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 13:48:02,899 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,SelfDestructingSolverStorable17 [2024-11-08 13:48:02,899 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:48:02,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:48:02,900 INFO L85 PathProgramCache]: Analyzing trace with hash -609406221, now seen corresponding path program 7 times [2024-11-08 13:48:02,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:48:02,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828547263] [2024-11-08 13:48:02,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:48:02,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:48:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:48:02,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 13:48:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 13:48:03,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 13:48:03,001 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 13:48:03,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 13:48:03,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 13:48:03,008 INFO L407 BasicCegarLoop]: Path program histogram: [7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:48:03,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 13:48:03,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 01:48:03 BoogieIcfgContainer [2024-11-08 13:48:03,082 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 13:48:03,083 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 13:48:03,083 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 13:48:03,083 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 13:48:03,084 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:47:17" (3/4) ... [2024-11-08 13:48:03,084 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-08 13:48:03,143 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 13:48:03,143 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 13:48:03,144 INFO L158 Benchmark]: Toolchain (without parser) took 46967.33ms. Allocated memory was 182.5MB in the beginning and 878.7MB in the end (delta: 696.3MB). Free memory was 113.7MB in the beginning and 536.1MB in the end (delta: -422.5MB). Peak memory consumption was 275.4MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,144 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 13:48:03,144 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.52ms. Allocated memory is still 182.5MB. Free memory was 113.7MB in the beginning and 100.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,145 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.89ms. Allocated memory is still 182.5MB. Free memory was 100.7MB in the beginning and 98.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,145 INFO L158 Benchmark]: Boogie Preprocessor took 56.92ms. Allocated memory is still 182.5MB. Free memory was 98.7MB in the beginning and 96.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,145 INFO L158 Benchmark]: RCFGBuilder took 428.83ms. Allocated memory is still 182.5MB. Free memory was 96.6MB in the beginning and 141.7MB in the end (delta: -45.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,145 INFO L158 Benchmark]: TraceAbstraction took 46050.29ms. Allocated memory was 182.5MB in the beginning and 878.7MB in the end (delta: 696.3MB). Free memory was 141.0MB in the beginning and 541.4MB in the end (delta: -400.4MB). Peak memory consumption was 297.6MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,146 INFO L158 Benchmark]: Witness Printer took 60.67ms. Allocated memory is still 878.7MB. Free memory was 541.4MB in the beginning and 536.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 13:48:03,147 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.25ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 76.0MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.52ms. Allocated memory is still 182.5MB. Free memory was 113.7MB in the beginning and 100.7MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.89ms. Allocated memory is still 182.5MB. Free memory was 100.7MB in the beginning and 98.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.92ms. Allocated memory is still 182.5MB. Free memory was 98.7MB in the beginning and 96.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.83ms. Allocated memory is still 182.5MB. Free memory was 96.6MB in the beginning and 141.7MB in the end (delta: -45.1MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 46050.29ms. Allocated memory was 182.5MB in the beginning and 878.7MB in the end (delta: 696.3MB). Free memory was 141.0MB in the beginning and 541.4MB in the end (delta: -400.4MB). Peak memory consumption was 297.6MB. Max. memory is 16.1GB. * Witness Printer took 60.67ms. Allocated memory is still 878.7MB. Free memory was 541.4MB in the beginning and 536.1MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) VAL [s0=2, s1=0, s2=2, s3=0] [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L47] CALL, EXPR 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] [L47] RET, EXPR check_sum(s0, s1, s2, s3) [L46-L47] s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L46-L47] COND TRUE s0 + s1 + s2 + s3 == 4 && s0 * 0 + s1 * 1 + s2 * 2 + s3 * 3 == 4 && check_sum(s0, s1, s2, s3) [L48] 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 19, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2289 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2289 mSDsluCounter, 6172 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5418 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15052 IncrementalHoareTripleChecker+Invalid, 15211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 754 mSDtfsCounter, 15052 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2663 GetRequests, 1709 SyntacticMatches, 10 SemanticMatches, 944 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96222 ImplicationChecksByTransitivity, 23.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4152occurred in iteration=18, InterpolantAutomatonStates: 843, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 6111 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2106 NumberOfCodeBlocks, 1949 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 2820 ConstructedInterpolants, 0 QuantifiedInterpolants, 13707 SizeOfPredicates, 61 NumberOfNonLiveVariables, 2450 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 8422/10472 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-08 13:48:03,180 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