./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.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 5adbbf8a924bfe8763640545f809c584dffdae3b3be7bc6b6666374423fa435d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:48:20,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:48:20,812 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:48:20,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:48:20,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:48:20,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:48:20,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:48:20,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:48:20,843 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:48:20,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:48:20,844 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:48:20,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:48:20,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:48:20,845 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:48:20,847 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:48:20,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:48:20,848 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:48:20,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:48:20,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:48:20,849 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:48:20,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:48:20,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:48:20,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:48:20,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:48:20,853 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:48:20,853 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:48:20,854 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:48:20,854 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:48:20,854 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:48:20,854 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:48:20,854 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:48:20,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:48:20,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:48:20,855 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:48:20,855 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:48:20,855 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:48:20,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:48:20,856 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:48:20,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:48:20,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:48:20,857 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:48:20,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:48:20,858 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 -> 5adbbf8a924bfe8763640545f809c584dffdae3b3be7bc6b6666374423fa435d [2024-11-09 00:48:21,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:48:21,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:48:21,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:48:21,145 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:48:21,146 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:48:21,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-11-09 00:48:22,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:48:22,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:48:22,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-11-09 00:48:22,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a8209f8/8d832a0e075c48f9b877e4c5f3a47fce/FLAGd91261baf [2024-11-09 00:48:22,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48a8209f8/8d832a0e075c48f9b877e4c5f3a47fce [2024-11-09 00:48:22,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:48:22,957 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:48:22,960 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:48:22,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:48:22,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:48:22,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:48:22" (1/1) ... [2024-11-09 00:48:22,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4df433d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:22, skipping insertion in model container [2024-11-09 00:48:22,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:48:22" (1/1) ... [2024-11-09 00:48:23,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:48:23,217 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_operatoramount_amount25_file-34.i[915,928] [2024-11-09 00:48:23,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:48:23,290 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:48:23,306 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_operatoramount_amount25_file-34.i[915,928] [2024-11-09 00:48:23,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:48:23,360 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:48:23,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23 WrapperNode [2024-11-09 00:48:23,361 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:48:23,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:48:23,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:48:23,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:48:23,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,412 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-09 00:48:23,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:48:23,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:48:23,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:48:23,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:48:23,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,454 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-09 00:48:23,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,463 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:48:23,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:48:23,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:48:23,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:48:23,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (1/1) ... [2024-11-09 00:48:23,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:48:23,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:48:23,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 00:48:23,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 00:48:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:48:23,583 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:48:23,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:48:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:48:23,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:48:23,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:48:23,667 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:48:23,671 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:48:23,953 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 00:48:23,953 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:48:23,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:48:23,966 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:48:23,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:48:23 BoogieIcfgContainer [2024-11-09 00:48:23,967 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:48:23,969 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:48:23,969 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:48:23,972 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:48:23,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:48:22" (1/3) ... [2024-11-09 00:48:23,973 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc4b144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:48:23, skipping insertion in model container [2024-11-09 00:48:23,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:48:23" (2/3) ... [2024-11-09 00:48:23,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc4b144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:48:23, skipping insertion in model container [2024-11-09 00:48:23,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:48:23" (3/3) ... [2024-11-09 00:48:23,975 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-34.i [2024-11-09 00:48:23,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:48:23,990 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:48:24,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:48:24,067 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;@41c387e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:48:24,067 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:48:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:48:24,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:48:24,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:24,083 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:24,083 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:24,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:24,089 INFO L85 PathProgramCache]: Analyzing trace with hash 857054501, now seen corresponding path program 1 times [2024-11-09 00:48:24,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:24,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845886167] [2024-11-09 00:48:24,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:24,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:48:24,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:24,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845886167] [2024-11-09 00:48:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845886167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:48:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529686676] [2024-11-09 00:48:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:24,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:48:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:48:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:48:24,496 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:48:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:24,523 INFO L93 Difference]: Finished difference Result 71 states and 113 transitions. [2024-11-09 00:48:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:48:24,526 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 63 [2024-11-09 00:48:24,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:24,534 INFO L225 Difference]: With dead ends: 71 [2024-11-09 00:48:24,534 INFO L226 Difference]: Without dead ends: 35 [2024-11-09 00:48:24,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:48:24,545 INFO L432 NwaCegarLoop]: 48 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, 48 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:24,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:48:24,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-09 00:48:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-09 00:48:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 00:48:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2024-11-09 00:48:24,593 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 63 [2024-11-09 00:48:24,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:24,594 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2024-11-09 00:48:24,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-09 00:48:24,595 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2024-11-09 00:48:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:48:24,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:24,599 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:24,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:48:24,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:24,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2129341725, now seen corresponding path program 1 times [2024-11-09 00:48:24,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:24,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824836732] [2024-11-09 00:48:24,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:24,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:48:27,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:27,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824836732] [2024-11-09 00:48:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824836732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:27,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:27,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:48:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749182378] [2024-11-09 00:48:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:27,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:48:27,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:48:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:48:27,317 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:27,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:27,694 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2024-11-09 00:48:27,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:48:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-09 00:48:27,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:27,698 INFO L225 Difference]: With dead ends: 94 [2024-11-09 00:48:27,698 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 00:48:27,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:48:27,700 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 66 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:27,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 207 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:48:27,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 00:48:27,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 71. [2024-11-09 00:48:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 50 states have internal predecessors, (64), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 00:48:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-11-09 00:48:27,731 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 63 [2024-11-09 00:48:27,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:27,732 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-11-09 00:48:27,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:27,732 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-11-09 00:48:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 00:48:27,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:27,734 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:27,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:48:27,734 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:27,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:27,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2127494683, now seen corresponding path program 1 times [2024-11-09 00:48:27,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:27,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818294236] [2024-11-09 00:48:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:27,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:48:29,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:29,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818294236] [2024-11-09 00:48:29,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818294236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:29,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:29,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 00:48:29,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136288105] [2024-11-09 00:48:29,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:29,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 00:48:29,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:29,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 00:48:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:48:29,083 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:29,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:29,514 INFO L93 Difference]: Finished difference Result 234 states and 315 transitions. [2024-11-09 00:48:29,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 00:48:29,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 63 [2024-11-09 00:48:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:29,520 INFO L225 Difference]: With dead ends: 234 [2024-11-09 00:48:29,520 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 00:48:29,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 00:48:29,526 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:29,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 303 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:48:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 00:48:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 140. [2024-11-09 00:48:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.168421052631579) internal successors, (111), 95 states have internal predecessors, (111), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-09 00:48:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2024-11-09 00:48:29,567 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 63 [2024-11-09 00:48:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:29,567 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2024-11-09 00:48:29,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:29,568 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2024-11-09 00:48:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:48:29,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:29,569 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:29,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:48:29,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:29,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:29,576 INFO L85 PathProgramCache]: Analyzing trace with hash -615999721, now seen corresponding path program 1 times [2024-11-09 00:48:29,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:29,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41081925] [2024-11-09 00:48:29,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:29,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:29,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:48:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41081925] [2024-11-09 00:48:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41081925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:29,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 00:48:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097552434] [2024-11-09 00:48:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:29,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 00:48:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 00:48:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 00:48:29,768 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:29,856 INFO L93 Difference]: Finished difference Result 367 states and 486 transitions. [2024-11-09 00:48:29,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:48:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-09 00:48:29,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:29,860 INFO L225 Difference]: With dead ends: 367 [2024-11-09 00:48:29,860 INFO L226 Difference]: Without dead ends: 230 [2024-11-09 00:48:29,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-09 00:48:29,867 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 55 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:29,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 137 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:48:29,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-11-09 00:48:29,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 186. [2024-11-09 00:48:29,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 121 states have (on average 1.1487603305785123) internal successors, (139), 123 states have internal predecessors, (139), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:48:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 247 transitions. [2024-11-09 00:48:29,924 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 247 transitions. Word has length 64 [2024-11-09 00:48:29,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:29,924 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 247 transitions. [2024-11-09 00:48:29,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2024-11-09 00:48:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:48:29,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:29,926 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:29,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 00:48:29,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:29,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash -356597792, now seen corresponding path program 1 times [2024-11-09 00:48:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654506946] [2024-11-09 00:48:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:29,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-09 00:48:31,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654506946] [2024-11-09 00:48:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654506946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:48:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843075825] [2024-11-09 00:48:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:48:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:31,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:48:31,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:48:31,585 INFO L87 Difference]: Start difference. First operand 186 states and 247 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:31,835 INFO L93 Difference]: Finished difference Result 319 states and 419 transitions. [2024-11-09 00:48:31,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:48:31,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 64 [2024-11-09 00:48:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:31,843 INFO L225 Difference]: With dead ends: 319 [2024-11-09 00:48:31,843 INFO L226 Difference]: Without dead ends: 228 [2024-11-09 00:48:31,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:48:31,846 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 40 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:31,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 185 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:48:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-11-09 00:48:31,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 192. [2024-11-09 00:48:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 127 states have (on average 1.1574803149606299) internal successors, (147), 129 states have internal predecessors, (147), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-09 00:48:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 255 transitions. [2024-11-09 00:48:31,896 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 255 transitions. Word has length 64 [2024-11-09 00:48:31,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:31,897 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 255 transitions. [2024-11-09 00:48:31,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:31,897 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 255 transitions. [2024-11-09 00:48:31,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-09 00:48:31,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:31,898 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:31,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 00:48:31,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:31,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash -299339490, now seen corresponding path program 1 times [2024-11-09 00:48:31,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:31,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56931155] [2024-11-09 00:48:31,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 00:48:32,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56931155] [2024-11-09 00:48:32,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56931155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:48:32,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189397752] [2024-11-09 00:48:32,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:32,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:48:32,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:48:32,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:48:32,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 00:48:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:32,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 00:48:32,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:48:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-09 00:48:32,401 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:48:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-09 00:48:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189397752] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:48:32,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:48:32,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-09 00:48:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871195732] [2024-11-09 00:48:32,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:48:32,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:48:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:32,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:48:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:48:32,527 INFO L87 Difference]: Start difference. First operand 192 states and 255 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 00:48:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:32,690 INFO L93 Difference]: Finished difference Result 309 states and 398 transitions. [2024-11-09 00:48:32,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 00:48:32,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 64 [2024-11-09 00:48:32,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:32,693 INFO L225 Difference]: With dead ends: 309 [2024-11-09 00:48:32,693 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 00:48:32,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-09 00:48:32,697 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 81 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:32,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 74 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:48:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 00:48:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 108. [2024-11-09 00:48:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 73 states have internal predecessors, (78), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-09 00:48:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2024-11-09 00:48:32,714 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 64 [2024-11-09 00:48:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:32,715 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2024-11-09 00:48:32,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 00:48:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2024-11-09 00:48:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:48:32,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:32,717 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:32,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 00:48:32,918 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,SelfDestructingSolverStorable5 [2024-11-09 00:48:32,919 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:32,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:32,920 INFO L85 PathProgramCache]: Analyzing trace with hash 319681300, now seen corresponding path program 1 times [2024-11-09 00:48:32,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:32,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897640575] [2024-11-09 00:48:32,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:32,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:33,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:33,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:48:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:48:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:48:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:48:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:48:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:48:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:48:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:48:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:48:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 00:48:33,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:33,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897640575] [2024-11-09 00:48:33,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897640575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:33,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:33,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 00:48:33,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955073882] [2024-11-09 00:48:33,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:33,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 00:48:33,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:33,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 00:48:33,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 00:48:33,224 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:48:33,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:33,356 INFO L93 Difference]: Finished difference Result 221 states and 267 transitions. [2024-11-09 00:48:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:48:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2024-11-09 00:48:33,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:33,358 INFO L225 Difference]: With dead ends: 221 [2024-11-09 00:48:33,359 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 00:48:33,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:48:33,361 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:33,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:48:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 00:48:33,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 99. [2024-11-09 00:48:33,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 70 states have internal predecessors, (74), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:48:33,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2024-11-09 00:48:33,383 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 124 [2024-11-09 00:48:33,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:33,385 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2024-11-09 00:48:33,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 00:48:33,385 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2024-11-09 00:48:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:48:33,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:33,387 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:33,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 00:48:33,388 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:33,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -489665326, now seen corresponding path program 1 times [2024-11-09 00:48:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:33,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64493912] [2024-11-09 00:48:33,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:34,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:48:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:48:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:48:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:48:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:48:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:48:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:48:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:48:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:48:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2024-11-09 00:48:34,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:34,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64493912] [2024-11-09 00:48:34,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64493912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:34,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:34,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:48:34,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143187038] [2024-11-09 00:48:34,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:34,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:48:34,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:34,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:48:34,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:48:34,851 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:35,119 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-09 00:48:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:48:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 124 [2024-11-09 00:48:35,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:35,121 INFO L225 Difference]: With dead ends: 104 [2024-11-09 00:48:35,121 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 00:48:35,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:48:35,124 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 22 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:35,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:48:35,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 00:48:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-09 00:48:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 67 states have internal predecessors, (70), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 00:48:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 112 transitions. [2024-11-09 00:48:35,144 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 112 transitions. Word has length 124 [2024-11-09 00:48:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:35,145 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 112 transitions. [2024-11-09 00:48:35,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 112 transitions. [2024-11-09 00:48:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 00:48:35,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:48:35,149 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 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] [2024-11-09 00:48:35,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 00:48:35,150 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:48:35,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:48:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash -487818284, now seen corresponding path program 1 times [2024-11-09 00:48:35,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:48:35,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765464766] [2024-11-09 00:48:35,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:48:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:48:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:48:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 00:48:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-09 00:48:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-09 00:48:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 00:48:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-09 00:48:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 00:48:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-09 00:48:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 00:48:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:48:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 00:48:36,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:48:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 00:48:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:48:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:48:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 00:48:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 00:48:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 00:48:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:48:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2024-11-09 00:48:36,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:48:36,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765464766] [2024-11-09 00:48:36,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765464766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:48:36,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:48:36,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 00:48:36,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700687645] [2024-11-09 00:48:36,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:48:36,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 00:48:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:48:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 00:48:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-09 00:48:36,433 INFO L87 Difference]: Start difference. First operand 96 states and 112 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:36,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:48:36,714 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2024-11-09 00:48:36,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:48:36,715 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 124 [2024-11-09 00:48:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:48:36,716 INFO L225 Difference]: With dead ends: 102 [2024-11-09 00:48:36,716 INFO L226 Difference]: Without dead ends: 0 [2024-11-09 00:48:36,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:48:36,717 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 14 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:48:36,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 195 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:48:36,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-09 00:48:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-09 00:48:36,718 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-09 00:48:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-09 00:48:36,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 124 [2024-11-09 00:48:36,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:48:36,719 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-09 00:48:36,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-09 00:48:36,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-09 00:48:36,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-09 00:48:36,723 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:48:36,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 00:48:36,726 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:48:36,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-09 00:48:37,973 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:48:37,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:48:37 BoogieIcfgContainer [2024-11-09 00:48:37,996 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:48:37,997 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:48:37,997 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:48:37,998 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:48:37,998 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:48:23" (3/4) ... [2024-11-09 00:48:38,001 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 00:48:38,005 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-09 00:48:38,010 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-09 00:48:38,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 00:48:38,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 00:48:38,011 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 00:48:38,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 00:48:38,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 00:48:38,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:48:38,118 INFO L158 Benchmark]: Toolchain (without parser) took 15161.32ms. Allocated memory was 163.6MB in the beginning and 434.1MB in the end (delta: 270.5MB). Free memory was 95.7MB in the beginning and 304.4MB in the end (delta: -208.7MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,118 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:48:38,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.32ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 129.1MB in the end (delta: -33.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.74ms. Allocated memory is still 163.6MB. Free memory was 129.1MB in the beginning and 127.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,119 INFO L158 Benchmark]: Boogie Preprocessor took 72.92ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 124.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,123 INFO L158 Benchmark]: RCFGBuilder took 479.88ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 109.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,123 INFO L158 Benchmark]: TraceAbstraction took 14027.80ms. Allocated memory was 163.6MB in the beginning and 434.1MB in the end (delta: 270.5MB). Free memory was 109.1MB in the beginning and 309.6MB in the end (delta: -200.5MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,123 INFO L158 Benchmark]: Witness Printer took 120.63ms. Allocated memory is still 434.1MB. Free memory was 309.6MB in the beginning and 304.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:48:38,125 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.20ms. Allocated memory is still 113.2MB. Free memory is still 74.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.32ms. Allocated memory is still 163.6MB. Free memory was 95.5MB in the beginning and 129.1MB in the end (delta: -33.6MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.74ms. Allocated memory is still 163.6MB. Free memory was 129.1MB in the beginning and 127.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.92ms. Allocated memory is still 163.6MB. Free memory was 127.1MB in the beginning and 124.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.88ms. Allocated memory is still 163.6MB. Free memory was 124.4MB in the beginning and 109.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14027.80ms. Allocated memory was 163.6MB in the beginning and 434.1MB in the end (delta: 270.5MB). Free memory was 109.1MB in the beginning and 309.6MB in the end (delta: -200.5MB). Peak memory consumption was 233.4MB. Max. memory is 16.1GB. * Witness Printer took 120.63ms. Allocated memory is still 434.1MB. Free memory was 309.6MB in the beginning and 304.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.7s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 397 mSDsluCounter, 1438 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1019 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 504 IncrementalHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 419 mSDtfsCounter, 504 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 378 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=192occurred in iteration=5, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 162 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 817 NumberOfCodeBlocks, 817 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 2995 SizeOfPredicates, 2 NumberOfNonLiveVariables, 174 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3021/3057 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: 86]: Loop Invariant Derived loop invariant: (((((var_1_11 <= ((short) var_1_11 + var_1_17)) && (var_1_17 <= var_1_11)) && (last_1_var_1_17 <= 0)) && (var_1_8 == 0)) && (var_1_11 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((last_1_var_1_17 <= 0) && (var_1_8 == 0)) && (var_1_17 <= 0)) Ensures: (((((cond != 0) && (last_1_var_1_17 <= 0)) && (var_1_8 == 0)) && (var_1_17 <= 0)) && (((((((((((((((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_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (last_1_var_1_5 == \old(last_1_var_1_5))) && (last_1_var_1_17 == \old(last_1_var_1_17)))) RESULT: Ultimate proved your program to be correct! [2024-11-09 00:48:38,158 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