./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5adbbf8a924bfe8763640545f809c584dffdae3b3be7bc6b6666374423fa435d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:32:45,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:32:45,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:32:45,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:32:45,347 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:32:45,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:32:45,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:32:45,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:32:45,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:32:45,391 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:32:45,391 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:32:45,392 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:32:45,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:32:45,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:32:45,393 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:32:45,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:32:45,394 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:32:45,394 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:32:45,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:32:45,395 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:32:45,395 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:32:45,396 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:32:45,396 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:32:45,396 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:32:45,396 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:32:45,397 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:32:45,397 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:32:45,397 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:32:45,397 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:32:45,398 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:32:45,398 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:32:45,398 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:32:45,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:32:45,399 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:32:45,399 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:32:45,399 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:32:45,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:32:45,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:32:45,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:32:45,401 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:32:45,401 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:32:45,401 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:32:45,402 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5adbbf8a924bfe8763640545f809c584dffdae3b3be7bc6b6666374423fa435d [2024-11-10 08:32:45,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:32:45,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:32:45,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:32:45,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:32:45,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:32:45,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-11-10 08:32:47,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:32:47,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:32:47,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-11-10 08:32:47,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc01a736/fddf37d142494c04952de49e265e085b/FLAG4823650d9 [2024-11-10 08:32:47,712 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcc01a736/fddf37d142494c04952de49e265e085b [2024-11-10 08:32:47,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:32:47,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:32:47,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:32:47,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:32:47,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:32:47,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:32:47" (1/1) ... [2024-11-10 08:32:47,724 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f628b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:47, skipping insertion in model container [2024-11-10 08:32:47,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:32:47" (1/1) ... [2024-11-10 08:32:47,748 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:32:47,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i[915,928] [2024-11-10 08:32:47,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:32:47,960 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:32:47,970 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i[915,928] [2024-11-10 08:32:47,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:32:48,011 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:32:48,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48 WrapperNode [2024-11-10 08:32:48,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:32:48,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:32:48,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:32:48,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:32:48,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,029 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,056 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-10 08:32:48,057 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:32:48,058 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:32:48,058 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:32:48,058 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:32:48,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,067 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,069 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,081 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:32:48,084 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,084 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,088 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,092 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:32:48,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:32:48,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:32:48,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:32:48,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (1/1) ... [2024-11-10 08:32:48,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:32:48,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:32:48,139 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:32:48,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:32:48,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:32:48,208 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:32:48,208 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:32:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:32:48,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:32:48,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:32:48,275 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:32:48,277 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:32:48,420 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 08:32:48,420 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:32:48,437 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:32:48,437 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:32:48,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:32:48 BoogieIcfgContainer [2024-11-10 08:32:48,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:32:48,443 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:32:48,443 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:32:48,446 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:32:48,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:32:47" (1/3) ... [2024-11-10 08:32:48,447 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b33bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:32:48, skipping insertion in model container [2024-11-10 08:32:48,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:32:48" (2/3) ... [2024-11-10 08:32:48,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b33bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:32:48, skipping insertion in model container [2024-11-10 08:32:48,449 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:32:48" (3/3) ... [2024-11-10 08:32:48,450 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-34.i [2024-11-10 08:32:48,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:32:48,463 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:32:48,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:32:48,538 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;@60164b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:32:48,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:32:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 08:32:48,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 08:32:48,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:48,558 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:48,559 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:48,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:48,563 INFO L85 PathProgramCache]: Analyzing trace with hash -345055984, now seen corresponding path program 1 times [2024-11-10 08:32:48,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920947437] [2024-11-10 08:32:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:48,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 08:32:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:48,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920947437] [2024-11-10 08:32:48,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920947437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:48,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:48,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 08:32:48,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690357190] [2024-11-10 08:32:48,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:48,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 08:32:48,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:48,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 08:32:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:32:48,854 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 states have internal predecessors, (40), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 08:32:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:48,871 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2024-11-10 08:32:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 08:32:48,873 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 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 65 [2024-11-10 08:32:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:48,878 INFO L225 Difference]: With dead ends: 76 [2024-11-10 08:32:48,878 INFO L226 Difference]: Without dead ends: 37 [2024-11-10 08:32:48,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 08:32:48,886 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:48,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:32:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-10 08:32:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-10 08:32:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 08:32:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-10 08:32:48,933 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 65 [2024-11-10 08:32:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:48,933 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-10 08:32:48,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-10 08:32:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-10 08:32:48,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 08:32:48,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:48,935 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:48,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:32:48,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1537040879, now seen corresponding path program 1 times [2024-11-10 08:32:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524268406] [2024-11-10 08:32:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 08:32:51,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:51,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524268406] [2024-11-10 08:32:51,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524268406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:51,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:51,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:32:51,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37875892] [2024-11-10 08:32:51,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:51,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:32:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:32:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:32:51,075 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:51,531 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2024-11-10 08:32:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:32:51,532 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 65 [2024-11-10 08:32:51,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:51,534 INFO L225 Difference]: With dead ends: 105 [2024-11-10 08:32:51,534 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 08:32:51,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:32:51,536 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 93 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:51,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 236 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:32:51,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 08:32:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2024-11-10 08:32:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:32:51,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-11-10 08:32:51,551 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 65 [2024-11-10 08:32:51,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:51,552 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-11-10 08:32:51,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-10 08:32:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 08:32:51,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:51,553 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:51,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:32:51,554 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:51,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1508411728, now seen corresponding path program 1 times [2024-11-10 08:32:51,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:51,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023317041] [2024-11-10 08:32:51,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:52,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:52,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 08:32:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023317041] [2024-11-10 08:32:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023317041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:52,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:52,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 08:32:52,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766099472] [2024-11-10 08:32:52,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:52,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 08:32:52,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:52,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 08:32:52,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 08:32:52,485 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:52,795 INFO L93 Difference]: Finished difference Result 249 states and 330 transitions. [2024-11-10 08:32:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 08:32:52,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 65 [2024-11-10 08:32:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:52,800 INFO L225 Difference]: With dead ends: 249 [2024-11-10 08:32:52,800 INFO L226 Difference]: Without dead ends: 178 [2024-11-10 08:32:52,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 08:32:52,802 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 67 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:52,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 364 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:32:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-10 08:32:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 145. [2024-11-10 08:32:52,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.16) internal successors, (116), 100 states have internal predecessors, (116), 36 states have call successors, (36), 8 states have call predecessors, (36), 8 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 08:32:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2024-11-10 08:32:52,843 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 65 [2024-11-10 08:32:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:52,844 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2024-11-10 08:32:52,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2024-11-10 08:32:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 08:32:52,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:52,847 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:32:52,847 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:52,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash -98669733, now seen corresponding path program 1 times [2024-11-10 08:32:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:52,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28701486] [2024-11-10 08:32:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:52,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 08:32:52,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:52,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28701486] [2024-11-10 08:32:52,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28701486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:52,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:52,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:32:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770093502] [2024-11-10 08:32:52,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:52,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:32:52,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:52,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:32:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:32:52,987 INFO L87 Difference]: Start difference. First operand 145 states and 188 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:53,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:53,054 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2024-11-10 08:32:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 08:32:53,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 66 [2024-11-10 08:32:53,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:53,057 INFO L225 Difference]: With dead ends: 342 [2024-11-10 08:32:53,058 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 08:32:53,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:32:53,062 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 36 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:53,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 132 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:32:53,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 08:32:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 168. [2024-11-10 08:32:53,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 113 states have (on average 1.1504424778761062) internal successors, (130), 113 states have internal predecessors, (130), 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-11-10 08:32:53,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2024-11-10 08:32:53,099 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 66 [2024-11-10 08:32:53,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:53,100 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2024-11-10 08:32:53,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:53,100 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2024-11-10 08:32:53,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 08:32:53,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:53,101 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:32:53,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:53,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1906124196, now seen corresponding path program 1 times [2024-11-10 08:32:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687817992] [2024-11-10 08:32:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:53,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 08:32:53,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:53,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687817992] [2024-11-10 08:32:53,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687817992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:53,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:53,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 08:32:53,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670763950] [2024-11-10 08:32:53,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:53,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 08:32:53,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:53,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 08:32:53,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 08:32:53,220 INFO L87 Difference]: Start difference. First operand 168 states and 220 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:53,299 INFO L93 Difference]: Finished difference Result 409 states and 537 transitions. [2024-11-10 08:32:53,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:32:53,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 66 [2024-11-10 08:32:53,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:53,303 INFO L225 Difference]: With dead ends: 409 [2024-11-10 08:32:53,303 INFO L226 Difference]: Without dead ends: 266 [2024-11-10 08:32:53,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:32:53,306 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:53,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 146 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:32:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-10 08:32:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 193. [2024-11-10 08:32:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 128 states have (on average 1.140625) internal successors, (146), 130 states have internal predecessors, (146), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 08:32:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 254 transitions. [2024-11-10 08:32:53,361 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 254 transitions. Word has length 66 [2024-11-10 08:32:53,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:53,361 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 254 transitions. [2024-11-10 08:32:53,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2024-11-10 08:32:53,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 08:32:53,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:53,366 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:53,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:32:53,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:53,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:53,367 INFO L85 PathProgramCache]: Analyzing trace with hash -340893192, now seen corresponding path program 1 times [2024-11-10 08:32:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480914854] [2024-11-10 08:32:53,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-10 08:32:54,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:54,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480914854] [2024-11-10 08:32:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480914854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:54,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:54,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 08:32:54,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827828500] [2024-11-10 08:32:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:54,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:32:54,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:54,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:32:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:32:54,426 INFO L87 Difference]: Start difference. First operand 193 states and 254 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:54,663 INFO L93 Difference]: Finished difference Result 340 states and 440 transitions. [2024-11-10 08:32:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 08:32:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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 66 [2024-11-10 08:32:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:54,667 INFO L225 Difference]: With dead ends: 340 [2024-11-10 08:32:54,667 INFO L226 Difference]: Without dead ends: 245 [2024-11-10 08:32:54,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-11-10 08:32:54,668 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:54,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 254 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:32:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-10 08:32:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 199. [2024-11-10 08:32:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 134 states have (on average 1.1492537313432836) internal successors, (154), 136 states have internal predecessors, (154), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 08:32:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 262 transitions. [2024-11-10 08:32:54,716 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 262 transitions. Word has length 66 [2024-11-10 08:32:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:54,716 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 262 transitions. [2024-11-10 08:32:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-10 08:32:54,717 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2024-11-10 08:32:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-10 08:32:54,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:54,718 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:54,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:32:54,719 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:54,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash 546610489, now seen corresponding path program 1 times [2024-11-10 08:32:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:54,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046039549] [2024-11-10 08:32:54,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:54,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:54,953 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-10 08:32:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046039549] [2024-11-10 08:32:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046039549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:32:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32203182] [2024-11-10 08:32:54,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:54,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:32:54,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:32:54,957 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:32:54,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 08:32:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 08:32:55,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:32:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 24 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-10 08:32:55,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:32:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-10 08:32:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32203182] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 08:32:55,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 08:32:55,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 08:32:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026785803] [2024-11-10 08:32:55,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 08:32:55,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 08:32:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:55,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 08:32:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:32:55,315 INFO L87 Difference]: Start difference. First operand 199 states and 262 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 08:32:55,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:55,475 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2024-11-10 08:32:55,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 08:32:55,476 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 66 [2024-11-10 08:32:55,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:55,479 INFO L225 Difference]: With dead ends: 320 [2024-11-10 08:32:55,479 INFO L226 Difference]: Without dead ends: 124 [2024-11-10 08:32:55,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:32:55,481 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 125 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:55,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 80 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:32:55,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-10 08:32:55,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2024-11-10 08:32:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 77 states have internal predecessors, (82), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-10 08:32:55,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2024-11-10 08:32:55,499 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 66 [2024-11-10 08:32:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:55,500 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2024-11-10 08:32:55,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 08:32:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2024-11-10 08:32:55,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 08:32:55,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:55,503 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:55,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 08:32:55,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:32:55,705 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:55,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:55,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1809145017, now seen corresponding path program 1 times [2024-11-10 08:32:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039730714] [2024-11-10 08:32:55,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:55,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:55,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:32:55,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:32:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:32:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:32:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:32:55,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:32:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 08:32:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 08:32:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 08:32:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:55,991 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:32:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039730714] [2024-11-10 08:32:55,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039730714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:32:55,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:32:55,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 08:32:55,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696236819] [2024-11-10 08:32:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:32:55,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 08:32:55,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:32:55,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 08:32:55,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 08:32:55,993 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:32:56,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:32:56,100 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2024-11-10 08:32:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:32:56,101 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 127 [2024-11-10 08:32:56,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:32:56,106 INFO L225 Difference]: With dead ends: 229 [2024-11-10 08:32:56,106 INFO L226 Difference]: Without dead ends: 120 [2024-11-10 08:32:56,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-10 08:32:56,108 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:32:56,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 58 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:32:56,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-10 08:32:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2024-11-10 08:32:56,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 74 states have internal predecessors, (78), 21 states have call successors, (21), 8 states have call predecessors, (21), 8 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-10 08:32:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2024-11-10 08:32:56,145 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 127 [2024-11-10 08:32:56,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:32:56,146 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2024-11-10 08:32:56,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:32:56,146 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2024-11-10 08:32:56,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-10 08:32:56,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:32:56,148 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:32:56,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:32:56,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:32:56,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:32:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1690554, now seen corresponding path program 1 times [2024-11-10 08:32:56,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:32:56,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518734921] [2024-11-10 08:32:56,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:56,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:32:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:32:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 08:32:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:32:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 08:32:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:32:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 08:32:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:32:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 08:32:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:32:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 08:32:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 08:32:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 08:32:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 08:32:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 08:32:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 08:32:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 08:32:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 08:32:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 08:32:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-10 08:32:57,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:32:57,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518734921] [2024-11-10 08:32:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518734921] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:32:57,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43912913] [2024-11-10 08:32:57,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:32:57,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:32:57,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:32:57,398 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:32:57,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 08:32:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:32:57,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 08:32:57,480 INFO L278 TraceCheckSpWp]: Computing forward predicates...