./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:32:18,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:32:18,506 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:32:18,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:32:18,514 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:32:18,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:32:18,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:32:18,539 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:32:18,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:32:18,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:32:18,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:32:18,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:32:18,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:32:18,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:32:18,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:32:18,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:32:18,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:32:18,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:32:18,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:32:18,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:32:18,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:32:18,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:32:18,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:32:18,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:32:18,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:32:18,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:32:18,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:32:18,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:32:18,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:32:18,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:32:18,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:32:18,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:32:18,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:32:18,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:32:18,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:32:18,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:32:18,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:32:18,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:32:18,551 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:32:18,551 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:32:18,551 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:32:18,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:32:18,553 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 -> 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 [2024-11-20 06:32:18,749 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:32:18,782 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:32:18,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:32:18,790 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:32:18,791 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:32:18,794 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-11-20 06:32:20,253 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:32:20,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:32:20,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-11-20 06:32:20,426 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfb6777e/da785581ab7c4119b856d7636bec4cb2/FLAG3da03c467 [2024-11-20 06:32:20,438 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bfb6777e/da785581ab7c4119b856d7636bec4cb2 [2024-11-20 06:32:20,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:32:20,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:32:20,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:32:20,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:32:20,446 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:32:20,447 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,447 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc0762d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20, skipping insertion in model container [2024-11-20 06:32:20,448 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,464 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:32:20,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2024-11-20 06:32:20,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:32:20,658 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:32:20,670 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2024-11-20 06:32:20,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:32:20,709 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:32:20,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20 WrapperNode [2024-11-20 06:32:20,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:32:20,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:32:20,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:32:20,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:32:20,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,824 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-11-20 06:32:20,828 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:32:20,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:32:20,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:32:20,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:32:20,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,855 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:32:20,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,873 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,875 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:32:20,882 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:32:20,882 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:32:20,882 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:32:20,883 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (1/1) ... [2024-11-20 06:32:20,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:32:20,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:32:20,914 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-20 06:32:20,923 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-20 06:32:20,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:32:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:32:20,965 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:32:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:32:20,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:32:20,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:32:21,023 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:32:21,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:32:21,234 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-20 06:32:21,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:32:21,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:32:21,243 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:32:21,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:21 BoogieIcfgContainer [2024-11-20 06:32:21,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:32:21,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:32:21,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:32:21,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:32:21,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:32:20" (1/3) ... [2024-11-20 06:32:21,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612fe31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:32:21, skipping insertion in model container [2024-11-20 06:32:21,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:32:20" (2/3) ... [2024-11-20 06:32:21,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1612fe31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:32:21, skipping insertion in model container [2024-11-20 06:32:21,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:21" (3/3) ... [2024-11-20 06:32:21,251 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2024-11-20 06:32:21,264 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:32:21,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:32:21,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:32:21,314 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;@2a9377f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:32:21,314 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:32:21,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 06:32:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 06:32:21,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:21,324 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:21,324 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:21,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1550587417, now seen corresponding path program 1 times [2024-11-20 06:32:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:21,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653735069] [2024-11-20 06:32:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:21,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:21,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653735069] [2024-11-20 06:32:21,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653735069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:21,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:21,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:32:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433906522] [2024-11-20 06:32:21,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:21,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:32:21,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:32:21,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:32:21,627 INFO L87 Difference]: Start difference. First operand has 49 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 06:32:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:21,645 INFO L93 Difference]: Finished difference Result 93 states and 140 transitions. [2024-11-20 06:32:21,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:32:21,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-11-20 06:32:21,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:21,652 INFO L225 Difference]: With dead ends: 93 [2024-11-20 06:32:21,652 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 06:32:21,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:32:21,659 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:21,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:32:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 06:32:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-20 06:32:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 06:32:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2024-11-20 06:32:21,696 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 58 [2024-11-20 06:32:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:21,697 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2024-11-20 06:32:21,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-20 06:32:21,697 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2024-11-20 06:32:21,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-20 06:32:21,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:21,699 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:21,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:32:21,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash -998114271, now seen corresponding path program 1 times [2024-11-20 06:32:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853255623] [2024-11-20 06:32:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:22,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:22,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:22,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853255623] [2024-11-20 06:32:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853255623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:22,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:22,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:32:22,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225915510] [2024-11-20 06:32:22,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:22,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:32:22,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:22,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:32:22,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:32:22,262 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:22,424 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2024-11-20 06:32:22,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:32:22,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2024-11-20 06:32:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:22,427 INFO L225 Difference]: With dead ends: 145 [2024-11-20 06:32:22,427 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 06:32:22,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:32:22,428 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 91 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:22,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 191 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:32:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 06:32:22,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2024-11-20 06:32:22,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-20 06:32:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2024-11-20 06:32:22,446 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 58 [2024-11-20 06:32:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:22,446 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2024-11-20 06:32:22,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:22,446 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2024-11-20 06:32:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 06:32:22,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:22,447 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:32:22,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:22,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:22,448 INFO L85 PathProgramCache]: Analyzing trace with hash -359529112, now seen corresponding path program 1 times [2024-11-20 06:32:22,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:22,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951266292] [2024-11-20 06:32:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:22,806 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:22,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:22,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951266292] [2024-11-20 06:32:22,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951266292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:22,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:22,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:32:22,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194027651] [2024-11-20 06:32:22,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:22,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:32:22,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:22,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:32:22,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:32:22,810 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:23,037 INFO L93 Difference]: Finished difference Result 218 states and 287 transitions. [2024-11-20 06:32:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:32:23,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-20 06:32:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:23,040 INFO L225 Difference]: With dead ends: 218 [2024-11-20 06:32:23,040 INFO L226 Difference]: Without dead ends: 178 [2024-11-20 06:32:23,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:32:23,042 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:23,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 230 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:32:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-20 06:32:23,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2024-11-20 06:32:23,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 06:32:23,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2024-11-20 06:32:23,063 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 59 [2024-11-20 06:32:23,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:23,064 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2024-11-20 06:32:23,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2024-11-20 06:32:23,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 06:32:23,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:23,066 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:23,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:32:23,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:23,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:23,067 INFO L85 PathProgramCache]: Analyzing trace with hash -946335126, now seen corresponding path program 1 times [2024-11-20 06:32:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:23,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544822005] [2024-11-20 06:32:23,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:23,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544822005] [2024-11-20 06:32:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544822005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:32:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130428943] [2024-11-20 06:32:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:32:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:32:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:32:23,154 INFO L87 Difference]: Start difference. First operand 119 states and 161 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:23,183 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2024-11-20 06:32:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:32:23,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-20 06:32:23,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:23,185 INFO L225 Difference]: With dead ends: 190 [2024-11-20 06:32:23,185 INFO L226 Difference]: Without dead ends: 150 [2024-11-20 06:32:23,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-20 06:32:23,186 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:23,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:32:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-20 06:32:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2024-11-20 06:32:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 06:32:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2024-11-20 06:32:23,208 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 59 [2024-11-20 06:32:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:23,209 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2024-11-20 06:32:23,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2024-11-20 06:32:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-20 06:32:23,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:23,211 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:23,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:32:23,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:23,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash -557374028, now seen corresponding path program 1 times [2024-11-20 06:32:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:23,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714603655] [2024-11-20 06:32:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:23,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:23,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:23,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714603655] [2024-11-20 06:32:23,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714603655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:23,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:23,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 06:32:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29304958] [2024-11-20 06:32:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:23,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:32:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:32:23,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 06:32:23,408 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:23,485 INFO L93 Difference]: Finished difference Result 281 states and 375 transitions. [2024-11-20 06:32:23,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:32:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-11-20 06:32:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:23,487 INFO L225 Difference]: With dead ends: 281 [2024-11-20 06:32:23,487 INFO L226 Difference]: Without dead ends: 180 [2024-11-20 06:32:23,488 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:32:23,489 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:23,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:32:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-20 06:32:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2024-11-20 06:32:23,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 06:32:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2024-11-20 06:32:23,509 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 59 [2024-11-20 06:32:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:23,509 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2024-11-20 06:32:23,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:23,511 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2024-11-20 06:32:23,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 06:32:23,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:23,512 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:23,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:32:23,512 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:23,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:23,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2058896717, now seen corresponding path program 1 times [2024-11-20 06:32:23,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:23,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967594293] [2024-11-20 06:32:23,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:23,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:24,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:24,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:24,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:24,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967594293] [2024-11-20 06:32:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967594293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:24,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:32:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798981661] [2024-11-20 06:32:24,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:24,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:32:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:32:24,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:32:24,388 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:24,561 INFO L93 Difference]: Finished difference Result 349 states and 460 transitions. [2024-11-20 06:32:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:32:24,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-20 06:32:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:24,564 INFO L225 Difference]: With dead ends: 349 [2024-11-20 06:32:24,564 INFO L226 Difference]: Without dead ends: 248 [2024-11-20 06:32:24,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:32:24,565 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 197 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:24,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 267 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:32:24,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-20 06:32:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 114. [2024-11-20 06:32:24,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 06:32:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2024-11-20 06:32:24,604 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 60 [2024-11-20 06:32:24,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:24,605 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2024-11-20 06:32:24,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2024-11-20 06:32:24,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 06:32:24,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:24,605 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:24,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:32:24,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:24,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2034785575, now seen corresponding path program 1 times [2024-11-20 06:32:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:24,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619306196] [2024-11-20 06:32:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:24,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,660 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:24,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:24,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619306196] [2024-11-20 06:32:24,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619306196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:32:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361849499] [2024-11-20 06:32:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:24,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:32:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:32:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:32:24,666 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:24,701 INFO L93 Difference]: Finished difference Result 204 states and 268 transitions. [2024-11-20 06:32:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:32:24,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-20 06:32:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:24,702 INFO L225 Difference]: With dead ends: 204 [2024-11-20 06:32:24,702 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 06:32:24,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-20 06:32:24,703 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:24,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 87 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:32:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 06:32:24,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 101. [2024-11-20 06:32:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-20 06:32:24,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2024-11-20 06:32:24,715 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 60 [2024-11-20 06:32:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:24,715 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2024-11-20 06:32:24,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2024-11-20 06:32:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 06:32:24,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:24,716 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:24,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:32:24,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1333720997, now seen corresponding path program 1 times [2024-11-20 06:32:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825725033] [2024-11-20 06:32:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:24,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:24,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825725033] [2024-11-20 06:32:24,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825725033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:24,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:24,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:32:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415697799] [2024-11-20 06:32:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:24,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:32:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:32:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:32:24,766 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:24,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:24,796 INFO L93 Difference]: Finished difference Result 184 states and 239 transitions. [2024-11-20 06:32:24,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:32:24,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2024-11-20 06:32:24,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:24,797 INFO L225 Difference]: With dead ends: 184 [2024-11-20 06:32:24,797 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 06:32:24,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-20 06:32:24,798 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:24,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 96 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:32:24,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 06:32:24,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2024-11-20 06:32:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:32:24,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2024-11-20 06:32:24,807 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 60 [2024-11-20 06:32:24,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:24,807 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2024-11-20 06:32:24,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2024-11-20 06:32:24,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 06:32:24,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:24,808 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:24,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:32:24,808 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:24,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:24,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1284924752, now seen corresponding path program 1 times [2024-11-20 06:32:24,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:24,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197773783] [2024-11-20 06:32:24,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:24,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:25,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:25,242 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:25,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:25,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197773783] [2024-11-20 06:32:25,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197773783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:25,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:25,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:32:25,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017281254] [2024-11-20 06:32:25,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:25,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:32:25,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:25,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:32:25,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:32:25,244 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:25,373 INFO L93 Difference]: Finished difference Result 259 states and 333 transitions. [2024-11-20 06:32:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:32:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2024-11-20 06:32:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:25,375 INFO L225 Difference]: With dead ends: 259 [2024-11-20 06:32:25,375 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 06:32:25,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:32:25,376 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 71 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:25,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 158 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:32:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 06:32:25,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2024-11-20 06:32:25,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.170940170940171) internal successors, (137), 117 states have internal predecessors, (137), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:32:25,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2024-11-20 06:32:25,389 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 61 [2024-11-20 06:32:25,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:25,389 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2024-11-20 06:32:25,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:25,389 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2024-11-20 06:32:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-20 06:32:25,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:25,390 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:25,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 06:32:25,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:25,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:25,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1703304963, now seen corresponding path program 1 times [2024-11-20 06:32:25,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:25,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271082550] [2024-11-20 06:32:25,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:25,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:26,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:26,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:26,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271082550] [2024-11-20 06:32:26,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271082550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:26,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:26,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:32:26,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374170164] [2024-11-20 06:32:26,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:26,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:32:26,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:26,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:32:26,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:32:26,041 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:26,695 INFO L93 Difference]: Finished difference Result 246 states and 310 transitions. [2024-11-20 06:32:26,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 06:32:26,696 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2024-11-20 06:32:26,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:26,697 INFO L225 Difference]: With dead ends: 246 [2024-11-20 06:32:26,698 INFO L226 Difference]: Without dead ends: 244 [2024-11-20 06:32:26,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2024-11-20 06:32:26,699 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 240 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:26,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 465 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:32:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-20 06:32:26,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 166. [2024-11-20 06:32:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.1654135338345866) internal successors, (155), 133 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:32:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2024-11-20 06:32:26,715 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 63 [2024-11-20 06:32:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:26,715 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2024-11-20 06:32:26,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2024-11-20 06:32:26,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-20 06:32:26,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:26,718 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 06:32:26,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 06:32:26,718 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:26,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -905581888, now seen corresponding path program 1 times [2024-11-20 06:32:26,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:26,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312231379] [2024-11-20 06:32:26,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,174 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-20 06:32:27,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312231379] [2024-11-20 06:32:27,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312231379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:27,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:32:27,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:32:27,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844641174] [2024-11-20 06:32:27,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:27,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:32:27,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:27,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:32:27,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:32:27,176 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:27,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:27,401 INFO L93 Difference]: Finished difference Result 175 states and 220 transitions. [2024-11-20 06:32:27,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:32:27,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2024-11-20 06:32:27,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:27,403 INFO L225 Difference]: With dead ends: 175 [2024-11-20 06:32:27,403 INFO L226 Difference]: Without dead ends: 173 [2024-11-20 06:32:27,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:32:27,403 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 47 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:32:27,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 441 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:32:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-20 06:32:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2024-11-20 06:32:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.1578947368421053) internal successors, (154), 133 states have internal predecessors, (154), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 06:32:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 210 transitions. [2024-11-20 06:32:27,414 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 210 transitions. Word has length 64 [2024-11-20 06:32:27,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:27,415 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 210 transitions. [2024-11-20 06:32:27,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-20 06:32:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 210 transitions. [2024-11-20 06:32:27,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 06:32:27,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:32:27,416 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:32:27,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 06:32:27,416 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:32:27,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:32:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 134997047, now seen corresponding path program 1 times [2024-11-20 06:32:27,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:32:27,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843645435] [2024-11-20 06:32:27,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:27,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:32:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:32:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:32:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:32:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:32:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:32:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 06:32:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 06:32:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 06:32:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:32:27,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 06:32:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:32:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 06:32:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 06:32:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 06:32:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,495 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:32:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:32:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843645435] [2024-11-20 06:32:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843645435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:32:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491468789] [2024-11-20 06:32:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:32:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:32:27,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:32:27,498 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-20 06:32:27,501 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-20 06:32:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:32:27,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 06:32:27,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:32:27,726 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2024-11-20 06:32:27,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:32:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491468789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:32:27,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 06:32:27,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-20 06:32:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924253791] [2024-11-20 06:32:27,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:32:27,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 06:32:27,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:32:27,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 06:32:27,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:32:27,733 INFO L87 Difference]: Start difference. First operand 166 states and 210 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 06:32:27,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:32:27,766 INFO L93 Difference]: Finished difference Result 203 states and 249 transitions. [2024-11-20 06:32:27,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 06:32:27,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2024-11-20 06:32:27,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:32:27,767 INFO L225 Difference]: With dead ends: 203 [2024-11-20 06:32:27,767 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 06:32:27,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:32:27,768 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 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-20 06:32:27,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:32:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 06:32:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 06:32:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 06:32:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 06:32:27,770 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2024-11-20 06:32:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:32:27,770 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 06:32:27,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-20 06:32:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 06:32:27,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 06:32:27,773 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:32:27,783 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-20 06:32:27,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 06:32:27,980 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:32:27,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-20 06:32:28,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:32:28,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:32:28 BoogieIcfgContainer [2024-11-20 06:32:28,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:32:28,486 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:32:28,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:32:28,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:32:28,487 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:32:21" (3/4) ... [2024-11-20 06:32:28,492 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 06:32:28,495 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-20 06:32:28,502 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-20 06:32:28,502 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 06:32:28,502 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 06:32:28,503 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 06:32:28,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 06:32:28,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 06:32:28,618 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:32:28,619 INFO L158 Benchmark]: Toolchain (without parser) took 8177.74ms. Allocated memory was 165.7MB in the beginning and 339.7MB in the end (delta: 174.1MB). Free memory was 96.4MB in the beginning and 254.9MB in the end (delta: -158.5MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,619 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 165.7MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:32:28,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.88ms. Allocated memory is still 165.7MB. Free memory was 96.3MB in the beginning and 82.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,619 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.51ms. Allocated memory is still 165.7MB. Free memory was 82.1MB in the beginning and 135.7MB in the end (delta: -53.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,620 INFO L158 Benchmark]: Boogie Preprocessor took 50.95ms. Allocated memory is still 165.7MB. Free memory was 135.7MB in the beginning and 132.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,620 INFO L158 Benchmark]: RCFGBuilder took 361.92ms. Allocated memory is still 165.7MB. Free memory was 132.3MB in the beginning and 116.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,620 INFO L158 Benchmark]: TraceAbstraction took 7240.47ms. Allocated memory was 165.7MB in the beginning and 339.7MB in the end (delta: 174.1MB). Free memory was 115.5MB in the beginning and 261.2MB in the end (delta: -145.7MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,620 INFO L158 Benchmark]: Witness Printer took 131.95ms. Allocated memory is still 339.7MB. Free memory was 261.2MB in the beginning and 254.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 06:32:28,621 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.14ms. Allocated memory is still 165.7MB. Free memory is still 121.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.88ms. Allocated memory is still 165.7MB. Free memory was 96.3MB in the beginning and 82.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.51ms. Allocated memory is still 165.7MB. Free memory was 82.1MB in the beginning and 135.7MB in the end (delta: -53.6MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.95ms. Allocated memory is still 165.7MB. Free memory was 135.7MB in the beginning and 132.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 361.92ms. Allocated memory is still 165.7MB. Free memory was 132.3MB in the beginning and 116.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7240.47ms. Allocated memory was 165.7MB in the beginning and 339.7MB in the end (delta: 174.1MB). Free memory was 115.5MB in the beginning and 261.2MB in the end (delta: -145.7MB). Peak memory consumption was 183.4MB. Max. memory is 16.1GB. * Witness Printer took 131.95ms. Allocated memory is still 339.7MB. Free memory was 261.2MB in the beginning and 254.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 859 mSDsluCounter, 2363 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1611 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 752 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 406 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 436 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 886 ConstructedInterpolants, 0 QuantifiedInterpolants, 3673 SizeOfPredicates, 0 NumberOfNonLiveVariables, 270 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1703/1704 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((0 <= 0) && (var_1_4 == 0)) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && (last_1_var_1_11 <= 8)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || (((((1 <= k_loop) && (var_1_5 == var_1_11)) && (var_1_1 == last_1_var_1_5)) && (256 == var_1_5)) && (256 == last_1_var_1_5))) || (((((((65531 == (((long long) 65520 + last_1_var_1_11) % 65536)) || (last_1_var_1_11 != last_1_var_1_5)) && (var_1_4 == 0)) && (1 <= k_loop)) && (((long long) 5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && (((var_1_6 == (var_1_5 + 8)) && ((last_1_var_1_5 + 8) <= var_1_6)) || ((var_1_6 <= (7 + last_1_var_1_5)) && (last_1_var_1_5 == var_1_5))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((((0 <= 0) && ((5 + var_1_1) == 0)) && (last_1_var_1_11 <= 8)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) Ensures: (((((((0 <= 0) && ((5 + var_1_1) == 0)) && (last_1_var_1_11 <= 8)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) && ((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_11 == \old(last_1_var_1_11)))) RESULT: Ultimate proved your program to be correct! [2024-11-20 06:32:28,636 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 Result: TRUE