./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 12:34:29,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 12:34:29,284 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 12:34:29,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 12:34:29,291 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 12:34:29,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 12:34:29,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 12:34:29,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 12:34:29,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 12:34:29,330 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 12:34:29,331 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 12:34:29,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 12:34:29,332 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 12:34:29,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 12:34:29,337 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 12:34:29,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 12:34:29,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 12:34:29,338 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 12:34:29,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 12:34:29,339 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 12:34:29,339 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 12:34:29,340 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 12:34:29,340 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 12:34:29,340 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 12:34:29,340 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 12:34:29,341 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 12:34:29,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 12:34:29,341 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 12:34:29,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 12:34:29,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 12:34:29,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 12:34:29,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 12:34:29,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:34:29,344 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 12:34:29,345 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 12:34:29,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 12:34:29,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 12:34:29,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 12:34:29,353 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 12:34:29,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 12:34:29,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 12:34:29,354 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 12:34:29,354 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-clean/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-clean/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-10-11 12:34:29,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 12:34:29,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 12:34:29,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 12:34:29,649 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 12:34:29,649 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 12:34:29,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-10-11 12:34:31,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 12:34:31,397 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 12:34:31,397 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-10-11 12:34:31,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/59b41ebe3/06684902514043629890041b437c57d2/FLAG96b0b12b1 [2024-10-11 12:34:31,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/59b41ebe3/06684902514043629890041b437c57d2 [2024-10-11 12:34:31,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 12:34:31,432 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 12:34:31,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 12:34:31,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 12:34:31,439 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 12:34:31,440 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,441 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d88f309 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31, skipping insertion in model container [2024-10-11 12:34:31,441 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,480 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 12:34:31,661 WARN L248 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-10-11 12:34:31,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:34:31,706 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 12:34:31,717 WARN L248 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-10-11 12:34:31,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 12:34:31,760 INFO L204 MainTranslator]: Completed translation [2024-10-11 12:34:31,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31 WrapperNode [2024-10-11 12:34:31,761 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 12:34:31,762 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 12:34:31,762 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 12:34:31,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 12:34:31,768 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,796 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-10-11 12:34:31,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 12:34:31,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 12:34:31,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 12:34:31,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 12:34:31,807 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,807 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,813 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,835 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-10-11 12:34:31,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,842 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 12:34:31,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 12:34:31,854 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 12:34:31,854 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 12:34:31,855 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (1/1) ... [2024-10-11 12:34:31,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 12:34:31,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:31,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 12:34:31,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 12:34:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 12:34:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 12:34:31,930 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 12:34:31,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 12:34:31,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 12:34:31,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 12:34:31,999 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 12:34:32,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 12:34:32,191 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 12:34:32,191 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 12:34:32,235 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 12:34:32,235 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 12:34:32,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:32 BoogieIcfgContainer [2024-10-11 12:34:32,236 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 12:34:32,238 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 12:34:32,238 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 12:34:32,244 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 12:34:32,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:34:31" (1/3) ... [2024-10-11 12:34:32,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5677c144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:32, skipping insertion in model container [2024-10-11 12:34:32,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:34:31" (2/3) ... [2024-10-11 12:34:32,245 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5677c144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:34:32, skipping insertion in model container [2024-10-11 12:34:32,245 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:32" (3/3) ... [2024-10-11 12:34:32,247 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-34.i [2024-10-11 12:34:32,264 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 12:34:32,264 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 12:34:32,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 12:34:32,322 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;@7adda86a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 12:34:32,322 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 12:34:32,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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-10-11 12:34:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 12:34:32,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:32,335 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] [2024-10-11 12:34:32,335 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:32,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:32,339 INFO L85 PathProgramCache]: Analyzing trace with hash 571880049, now seen corresponding path program 1 times [2024-10-11 12:34:32,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:32,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443995555] [2024-10-11 12:34:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 12:34:32,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:32,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443995555] [2024-10-11 12:34:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443995555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:32,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 12:34:32,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478407708] [2024-10-11 12:34:32,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:32,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 12:34:32,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:32,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 12:34:32,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 12:34:32,755 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10-11 12:34:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:32,800 INFO L93 Difference]: Finished difference Result 63 states and 105 transitions. [2024-10-11 12:34:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 12:34:32,806 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 59 [2024-10-11 12:34:32,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:32,812 INFO L225 Difference]: With dead ends: 63 [2024-10-11 12:34:32,813 INFO L226 Difference]: Without dead ends: 31 [2024-10-11 12:34:32,817 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-10-11 12:34:32,821 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:32,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:32,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-10-11 12:34:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-10-11 12:34:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-10-11 12:34:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2024-10-11 12:34:32,868 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 59 [2024-10-11 12:34:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:32,869 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2024-10-11 12:34:32,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10-11 12:34:32,870 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2024-10-11 12:34:32,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 12:34:32,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:32,872 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] [2024-10-11 12:34:32,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 12:34:32,873 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:32,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 614092019, now seen corresponding path program 1 times [2024-10-11 12:34:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:32,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479992045] [2024-10-11 12:34:32,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:32,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:35,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:35,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:35,683 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 12:34:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479992045] [2024-10-11 12:34:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479992045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:35,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:35,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:34:35,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612706929] [2024-10-11 12:34:35,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:35,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:34:35,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:34:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:34:35,690 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-10-11 12:34:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:36,020 INFO L93 Difference]: Finished difference Result 85 states and 115 transitions. [2024-10-11 12:34:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:34:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 59 [2024-10-11 12:34:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:36,023 INFO L225 Difference]: With dead ends: 85 [2024-10-11 12:34:36,023 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 12:34:36,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:34:36,025 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 64 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:36,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 151 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:34:36,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 12:34:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2024-10-11 12:34:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 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-10-11 12:34:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 93 transitions. [2024-10-11 12:34:36,043 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 93 transitions. Word has length 59 [2024-10-11 12:34:36,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:36,044 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 93 transitions. [2024-10-11 12:34:36,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-10-11 12:34:36,045 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 93 transitions. [2024-10-11 12:34:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 12:34:36,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:36,046 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] [2024-10-11 12:34:36,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 12:34:36,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:36,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:36,048 INFO L85 PathProgramCache]: Analyzing trace with hash 614151601, now seen corresponding path program 1 times [2024-10-11 12:34:36,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:36,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370874559] [2024-10-11 12:34:36,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:36,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:37,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:37,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,128 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 12:34:37,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:37,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370874559] [2024-10-11 12:34:37,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370874559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:37,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:37,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 12:34:37,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177945308] [2024-10-11 12:34:37,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:37,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 12:34:37,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:37,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 12:34:37,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 12:34:37,134 INFO L87 Difference]: Start difference. First operand 64 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-10-11 12:34:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:37,479 INFO L93 Difference]: Finished difference Result 161 states and 217 transitions. [2024-10-11 12:34:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 12:34:37,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 59 [2024-10-11 12:34:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:37,481 INFO L225 Difference]: With dead ends: 161 [2024-10-11 12:34:37,482 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 12:34:37,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:34:37,483 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 56 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:37,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 237 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 12:34:37,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 12:34:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2024-10-11 12:34:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 89 states have (on average 1.247191011235955) internal successors, (111), 89 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-10-11 12:34:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 183 transitions. [2024-10-11 12:34:37,536 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 183 transitions. Word has length 59 [2024-10-11 12:34:37,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:37,537 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 183 transitions. [2024-10-11 12:34:37,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-10-11 12:34:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 183 transitions. [2024-10-11 12:34:37,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 12:34:37,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:37,540 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] [2024-10-11 12:34:37,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 12:34:37,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:37,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:37,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1438364895, now seen corresponding path program 1 times [2024-10-11 12:34:37,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:37,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884100350] [2024-10-11 12:34:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:37,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:37,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 12:34:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:37,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884100350] [2024-10-11 12:34:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884100350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:34:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319925411] [2024-10-11 12:34:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:37,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:34:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:34:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:34:37,669 INFO L87 Difference]: Start difference. First operand 134 states and 183 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 12:34:37,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:37,764 INFO L93 Difference]: Finished difference Result 312 states and 427 transitions. [2024-10-11 12:34:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 12:34:37,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 60 [2024-10-11 12:34:37,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:37,768 INFO L225 Difference]: With dead ends: 312 [2024-10-11 12:34:37,770 INFO L226 Difference]: Without dead ends: 179 [2024-10-11 12:34:37,771 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-10-11 12:34:37,775 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:37,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:37,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-11 12:34:37,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 155. [2024-10-11 12:34:37,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.23) internal successors, (123), 100 states have internal predecessors, (123), 45 states have call successors, (45), 9 states have call predecessors, (45), 9 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 12:34:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2024-10-11 12:34:37,808 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 60 [2024-10-11 12:34:37,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:37,809 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2024-10-11 12:34:37,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 12:34:37,810 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2024-10-11 12:34:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 12:34:37,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:37,811 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] [2024-10-11 12:34:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 12:34:37,811 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:37,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:37,812 INFO L85 PathProgramCache]: Analyzing trace with hash 336642467, now seen corresponding path program 1 times [2024-10-11 12:34:37,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:37,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241446888] [2024-10-11 12:34:37,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:37,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 12:34:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:37,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241446888] [2024-10-11 12:34:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241446888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:37,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:37,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 12:34:37,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896489274] [2024-10-11 12:34:37,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:37,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 12:34:37,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:37,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 12:34:37,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 12:34:37,963 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 12:34:38,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:38,050 INFO L93 Difference]: Finished difference Result 371 states and 503 transitions. [2024-10-11 12:34:38,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:34:38,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 60 [2024-10-11 12:34:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:38,054 INFO L225 Difference]: With dead ends: 371 [2024-10-11 12:34:38,054 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 12:34:38,055 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-10-11 12:34:38,057 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 42 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:38,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 126 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 12:34:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 12:34:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2024-10-11 12:34:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 106 states have (on average 1.169811320754717) internal successors, (124), 108 states have internal predecessors, (124), 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-10-11 12:34:38,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2024-10-11 12:34:38,110 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 60 [2024-10-11 12:34:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:38,111 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2024-10-11 12:34:38,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-10-11 12:34:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2024-10-11 12:34:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 12:34:38,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:38,115 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] [2024-10-11 12:34:38,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 12:34:38,116 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:38,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:38,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1618044216, now seen corresponding path program 1 times [2024-10-11 12:34:38,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:38,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712515411] [2024-10-11 12:34:38,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:38,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:39,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-11 12:34:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:39,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712515411] [2024-10-11 12:34:39,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712515411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:39,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:39,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 12:34:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443944111] [2024-10-11 12:34:39,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:39,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:34:39,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:34:39,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:34:39,653 INFO L87 Difference]: Start difference. First operand 171 states and 232 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-10-11 12:34:39,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:39,863 INFO L93 Difference]: Finished difference Result 292 states and 392 transitions. [2024-10-11 12:34:39,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 12:34:39,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 60 [2024-10-11 12:34:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:39,868 INFO L225 Difference]: With dead ends: 292 [2024-10-11 12:34:39,868 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 12:34:39,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 12:34:39,869 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 22 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:39,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:39,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 12:34:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2024-10-11 12:34:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 113 states have internal predecessors, (131), 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-10-11 12:34:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 239 transitions. [2024-10-11 12:34:39,901 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 239 transitions. Word has length 60 [2024-10-11 12:34:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:39,902 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 239 transitions. [2024-10-11 12:34:39,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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-10-11 12:34:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 239 transitions. [2024-10-11 12:34:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-11 12:34:39,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:39,905 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] [2024-10-11 12:34:39,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 12:34:39,905 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:39,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:39,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1619891258, now seen corresponding path program 1 times [2024-10-11 12:34:39,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:39,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157035377] [2024-10-11 12:34:39,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:39,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 12:34:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157035377] [2024-10-11 12:34:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157035377] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:34:40,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389025721] [2024-10-11 12:34:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:40,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:40,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:40,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:34:40,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 12:34:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:40,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 12:34:40,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:34:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 12 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-11 12:34:40,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:34:40,454 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-10-11 12:34:40,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389025721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:34:40,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:34:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2024-10-11 12:34:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832843981] [2024-10-11 12:34:40,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:34:40,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 12:34:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:40,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 12:34:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 12:34:40,460 INFO L87 Difference]: Start difference. First operand 176 states and 239 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-10-11 12:34:40,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:40,649 INFO L93 Difference]: Finished difference Result 286 states and 375 transitions. [2024-10-11 12:34:40,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 12:34:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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 60 [2024-10-11 12:34:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:40,651 INFO L225 Difference]: With dead ends: 286 [2024-10-11 12:34:40,651 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 12:34:40,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-11 12:34:40,653 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 57 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:40,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:40,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 12:34:40,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 99. [2024-10-11 12:34:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 63 states have (on average 1.0952380952380953) internal successors, (69), 64 states have internal predecessors, (69), 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-10-11 12:34:40,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2024-10-11 12:34:40,672 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 60 [2024-10-11 12:34:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:40,673 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2024-10-11 12:34:40,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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-10-11 12:34:40,673 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2024-10-11 12:34:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 12:34:40,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:40,675 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:40,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 12:34:40,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:40,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:40,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:40,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1515412901, now seen corresponding path program 1 times [2024-10-11 12:34:40,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:40,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215381359] [2024-10-11 12:34:40,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:40,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 12:34:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 12:34:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 12:34:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 12:34:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 12:34:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 12:34:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 12:34:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 12:34:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 12:34:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 12:34:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215381359] [2024-10-11 12:34:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215381359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 12:34:41,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 12:34:41,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 12:34:41,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776970716] [2024-10-11 12:34:41,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 12:34:41,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 12:34:41,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:34:41,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 12:34:41,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 12:34:41,211 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-10-11 12:34:41,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:34:41,321 INFO L93 Difference]: Finished difference Result 205 states and 251 transitions. [2024-10-11 12:34:41,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 12:34:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 118 [2024-10-11 12:34:41,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:34:41,324 INFO L225 Difference]: With dead ends: 205 [2024-10-11 12:34:41,324 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 12:34:41,324 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-10-11 12:34:41,325 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 49 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 12:34:41,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 43 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 12:34:41,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 12:34:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 90. [2024-10-11 12:34:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 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-10-11 12:34:41,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2024-10-11 12:34:41,349 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 118 [2024-10-11 12:34:41,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:34:41,351 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2024-10-11 12:34:41,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-10-11 12:34:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2024-10-11 12:34:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 12:34:41,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 12:34:41,353 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:34:41,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 12:34:41,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 12:34:41,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 12:34:41,354 INFO L85 PathProgramCache]: Analyzing trace with hash 259594461, now seen corresponding path program 1 times [2024-10-11 12:34:41,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 12:34:41,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388236064] [2024-10-11 12:34:41,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 12:34:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 12:34:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 12:34:43,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 12:34:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 12:34:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 12:34:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 12:34:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 12:34:43,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 12:34:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 12:34:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 12:34:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 12:34:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 12:34:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 12:34:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 12:34:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 12:34:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 12:34:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 12:34:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 12:34:43,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2024-10-11 12:34:43,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 12:34:43,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388236064] [2024-10-11 12:34:43,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388236064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 12:34:43,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051751781] [2024-10-11 12:34:43,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 12:34:43,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:34:43,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 12:34:43,095 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 12:34:43,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 12:34:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 12:34:43,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 12:34:43,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 12:34:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 319 proven. 147 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2024-10-11 12:34:54,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 12:35:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 52 proven. 12 refuted. 0 times theorem prover too weak. 569 trivial. 0 not checked. [2024-10-11 12:35:11,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051751781] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 12:35:11,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 12:35:11,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 10] total 30 [2024-10-11 12:35:11,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058575837] [2024-10-11 12:35:11,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 12:35:11,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 12:35:11,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 12:35:11,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 12:35:11,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=691, Unknown=0, NotChecked=0, Total=870 [2024-10-11 12:35:11,568 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 5 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (38), 6 states have call predecessors, (38), 5 states have call successors, (38) [2024-10-11 12:35:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 12:35:15,327 INFO L93 Difference]: Finished difference Result 266 states and 301 transitions. [2024-10-11 12:35:15,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-11 12:35:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 5 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (38), 6 states have call predecessors, (38), 5 states have call successors, (38) Word has length 118 [2024-10-11 12:35:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 12:35:15,328 INFO L225 Difference]: With dead ends: 266 [2024-10-11 12:35:15,328 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 12:35:15,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1690 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1173, Invalid=4679, Unknown=0, NotChecked=0, Total=5852 [2024-10-11 12:35:15,331 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 147 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 12:35:15,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 339 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 12:35:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 12:35:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 12:35:15,332 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-10-11 12:35:15,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 12:35:15,332 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 118 [2024-10-11 12:35:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 12:35:15,333 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 12:35:15,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.9) internal successors, (87), 30 states have internal predecessors, (87), 5 states have call successors, (35), 4 states have call predecessors, (35), 8 states have return successors, (38), 6 states have call predecessors, (38), 5 states have call successors, (38) [2024-10-11 12:35:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 12:35:15,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 12:35:15,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 12:35:15,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 12:35:15,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 12:35:15,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 12:35:15,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 12:35:18,292 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 12:35:18,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:35:18 BoogieIcfgContainer [2024-10-11 12:35:18,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 12:35:18,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 12:35:18,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 12:35:18,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 12:35:18,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:34:32" (3/4) ... [2024-10-11 12:35:18,323 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 12:35:18,327 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-11 12:35:18,333 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-10-11 12:35:18,333 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 12:35:18,333 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 12:35:18,334 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 12:35:18,448 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 12:35:18,449 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 12:35:18,449 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 12:35:18,449 INFO L158 Benchmark]: Toolchain (without parser) took 47017.78ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 123.6MB in the beginning and 1.1GB in the end (delta: -955.9MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,450 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 12:35:18,450 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.06ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 110.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.59ms. Allocated memory is still 180.4MB. Free memory was 110.1MB in the beginning and 108.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,451 INFO L158 Benchmark]: Boogie Preprocessor took 56.30ms. Allocated memory is still 180.4MB. Free memory was 108.1MB in the beginning and 105.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,452 INFO L158 Benchmark]: RCFGBuilder took 382.14ms. Allocated memory is still 180.4MB. Free memory was 105.6MB in the beginning and 88.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,452 INFO L158 Benchmark]: TraceAbstraction took 46081.64ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 88.4MB in the beginning and 1.1GB in the end (delta: -996.3MB). Peak memory consumption was 680.7MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,452 INFO L158 Benchmark]: Witness Printer took 128.34ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 12:35:18,454 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.17ms. Allocated memory is still 180.4MB. Free memory is still 144.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.06ms. Allocated memory is still 180.4MB. Free memory was 123.6MB in the beginning and 110.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.59ms. Allocated memory is still 180.4MB. Free memory was 110.1MB in the beginning and 108.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.30ms. Allocated memory is still 180.4MB. Free memory was 108.1MB in the beginning and 105.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 382.14ms. Allocated memory is still 180.4MB. Free memory was 105.6MB in the beginning and 88.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 46081.64ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 88.4MB in the beginning and 1.1GB in the end (delta: -996.3MB). Peak memory consumption was 680.7MB. Max. memory is 16.1GB. * Witness Printer took 128.34ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.2s, OverallIterations: 9, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 466 mSDsluCounter, 1284 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 911 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1321 IncrementalHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 373 mSDtfsCounter, 1321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 693 GetRequests, 568 SyntacticMatches, 4 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=176occurred in iteration=6, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 194 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 36.4s InterpolantComputationTime, 831 NumberOfCodeBlocks, 831 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 996 ConstructedInterpolants, 0 QuantifiedInterpolants, 5522 SizeOfPredicates, 23 NumberOfNonLiveVariables, 442 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 3632/3828 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_15 <= 65534) && (var_1_17 <= var_1_11)) && (1 <= var_1_7)) && (var_1_11 <= 0)) && (var_1_8 == 0)) && (last_1_var_1_17 <= 0)) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (((((1 <= var_1_7) && (var_1_17 <= 0)) && (var_1_8 == 0)) && (last_1_var_1_17 <= 0)) || ((((var_1_17 <= var_1_11) && (var_1_11 <= 0)) && (var_1_8 == 0)) && (last_1_var_1_17 <= 0))) Ensures: ((cond != 0) && (((((1 <= var_1_7) && (var_1_17 <= 0)) && (var_1_8 == 0)) && (last_1_var_1_17 <= 0)) || ((((var_1_17 <= var_1_11) && (var_1_11 <= 0)) && (var_1_8 == 0)) && (last_1_var_1_17 <= 0)))) RESULT: Ultimate proved your program to be correct! [2024-10-11 12:35:18,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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