./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 3289d67d 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-3289d67-m [2024-11-16 17:29:48,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:29:48,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:29:48,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:29:48,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:29:48,817 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:29:48,818 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:29:48,818 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:29:48,819 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:29:48,822 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:29:48,822 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:29:48,822 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:29:48,823 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:29:48,823 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:29:48,823 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:29:48,823 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:29:48,824 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:29:48,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:29:48,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:29:48,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:29:48,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:29:48,826 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:29:48,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:29:48,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:29:48,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:29:48,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:29:48,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:29:48,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:29:48,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:29:48,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:29:48,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:29:48,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:29:48,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:29:48,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:29:48,828 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:29:48,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:29:48,830 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-16 17:29:49,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:29:49,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:29:49,082 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:29:49,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:29:49,083 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:29:49,085 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-16 17:29:50,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:29:50,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:29:50,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-34.i [2024-11-16 17:29:50,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b1120ae/38009587c3aa42a0b2aac62d6fd2ba61/FLAG2b7d725e3 [2024-11-16 17:29:50,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b1120ae/38009587c3aa42a0b2aac62d6fd2ba61 [2024-11-16 17:29:50,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:29:50,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:29:50,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:29:50,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:29:50,586 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:29:50,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58ccd46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50, skipping insertion in model container [2024-11-16 17:29:50,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:29:50,807 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-16 17:29:50,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:29:50,861 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:29:50,874 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-16 17:29:50,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:29:50,922 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:29:50,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50 WrapperNode [2024-11-16 17:29:50,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:29:50,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:29:50,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:29:50,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:29:50,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,959 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 87 [2024-11-16 17:29:50,963 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:29:50,964 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:29:50,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:29:50,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:29:50,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,981 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,992 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-16 17:29:50,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:50,999 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:51,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:51,001 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:51,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:51,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:29:51,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:29:51,009 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:29:51,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:29:51,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (1/1) ... [2024-11-16 17:29:51,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:29:51,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:29:51,048 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-16 17:29:51,050 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-16 17:29:51,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:29:51,089 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:29:51,090 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:29:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:29:51,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:29:51,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:29:51,155 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:29:51,157 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:29:51,367 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 17:29:51,367 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:29:51,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:29:51,377 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:29:51,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:29:51 BoogieIcfgContainer [2024-11-16 17:29:51,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:29:51,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:29:51,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:29:51,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:29:51,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:29:50" (1/3) ... [2024-11-16 17:29:51,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fab1f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:29:51, skipping insertion in model container [2024-11-16 17:29:51,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:29:50" (2/3) ... [2024-11-16 17:29:51,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fab1f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:29:51, skipping insertion in model container [2024-11-16 17:29:51,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:29:51" (3/3) ... [2024-11-16 17:29:51,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-34.i [2024-11-16 17:29:51,398 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:29:51,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:29:51,459 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:29:51,471 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;@6dbf94f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:29:51,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:29:51,475 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-16 17:29:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 17:29:51,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:51,485 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-16 17:29:51,485 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:51,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:51,489 INFO L85 PathProgramCache]: Analyzing trace with hash -345055984, now seen corresponding path program 1 times [2024-11-16 17:29:51,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:51,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550429645] [2024-11-16 17:29:51,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:51,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:51,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:51,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:51,727 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-16 17:29:51,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:51,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550429645] [2024-11-16 17:29:51,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550429645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:51,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:51,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:29:51,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782668474] [2024-11-16 17:29:51,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:51,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:29:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:29:51,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:29:51,767 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-16 17:29:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:51,787 INFO L93 Difference]: Finished difference Result 76 states and 118 transitions. [2024-11-16 17:29:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:29:51,790 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-16 17:29:51,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:51,795 INFO L225 Difference]: With dead ends: 76 [2024-11-16 17:29:51,795 INFO L226 Difference]: Without dead ends: 37 [2024-11-16 17:29:51,798 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-16 17:29:51,800 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-16 17:29:51,801 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-16 17:29:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-16 17:29:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-16 17:29:51,829 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-16 17:29:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-16 17:29:51,835 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 65 [2024-11-16 17:29:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:51,835 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-16 17:29:51,836 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-16 17:29:51,836 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-16 17:29:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 17:29:51,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:51,838 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-16 17:29:51,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:29:51,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:51,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1537040879, now seen corresponding path program 1 times [2024-11-16 17:29:51,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:51,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301362901] [2024-11-16 17:29:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:53,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:53,840 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-16 17:29:53,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:53,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301362901] [2024-11-16 17:29:53,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301362901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:53,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:53,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 17:29:53,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434273451] [2024-11-16 17:29:53,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:53,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:29:53,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:53,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:29:53,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:29:53,843 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-16 17:29:54,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:54,293 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2024-11-16 17:29:54,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 17:29:54,293 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-16 17:29:54,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:54,295 INFO L225 Difference]: With dead ends: 105 [2024-11-16 17:29:54,296 INFO L226 Difference]: Without dead ends: 102 [2024-11-16 17:29:54,296 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-16 17:29:54,297 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-16 17:29:54,297 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-16 17:29:54,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-16 17:29:54,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 74. [2024-11-16 17:29:54,314 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-16 17:29:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-11-16 17:29:54,317 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 65 [2024-11-16 17:29:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:54,318 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-11-16 17:29:54,319 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-16 17:29:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-16 17:29:54,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 17:29:54,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:54,322 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-16 17:29:54,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:29:54,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:54,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:54,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1508411728, now seen corresponding path program 1 times [2024-11-16 17:29:54,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:54,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369492773] [2024-11-16 17:29:54,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:54,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,123 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-16 17:29:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:55,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369492773] [2024-11-16 17:29:55,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369492773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:55,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:29:55,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021331168] [2024-11-16 17:29:55,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:55,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:29:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:29:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:29:55,125 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-16 17:29:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:55,442 INFO L93 Difference]: Finished difference Result 249 states and 330 transitions. [2024-11-16 17:29:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 17:29:55,443 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-16 17:29:55,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:55,445 INFO L225 Difference]: With dead ends: 249 [2024-11-16 17:29:55,445 INFO L226 Difference]: Without dead ends: 178 [2024-11-16 17:29:55,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-16 17:29:55,447 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-16 17:29:55,447 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-16 17:29:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-16 17:29:55,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 145. [2024-11-16 17:29:55,467 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-16 17:29:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2024-11-16 17:29:55,469 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 65 [2024-11-16 17:29:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:55,469 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2024-11-16 17:29:55,470 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-16 17:29:55,470 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2024-11-16 17:29:55,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 17:29:55,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:55,474 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-16 17:29:55,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:29:55,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:55,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:55,475 INFO L85 PathProgramCache]: Analyzing trace with hash -98669733, now seen corresponding path program 1 times [2024-11-16 17:29:55,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:55,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001157535] [2024-11-16 17:29:55,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:55,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:55,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:55,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,613 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-16 17:29:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:55,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001157535] [2024-11-16 17:29:55,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001157535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:55,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:55,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:29:55,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95255365] [2024-11-16 17:29:55,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:55,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:29:55,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:55,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:29:55,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:29:55,616 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-16 17:29:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:55,693 INFO L93 Difference]: Finished difference Result 342 states and 445 transitions. [2024-11-16 17:29:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:29:55,702 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-16 17:29:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:55,707 INFO L225 Difference]: With dead ends: 342 [2024-11-16 17:29:55,707 INFO L226 Difference]: Without dead ends: 200 [2024-11-16 17:29:55,709 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-16 17:29:55,709 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-16 17:29:55,710 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-16 17:29:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-16 17:29:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 168. [2024-11-16 17:29:55,741 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-16 17:29:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 220 transitions. [2024-11-16 17:29:55,743 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 220 transitions. Word has length 66 [2024-11-16 17:29:55,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:55,743 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 220 transitions. [2024-11-16 17:29:55,744 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-16 17:29:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 220 transitions. [2024-11-16 17:29:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 17:29:55,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:55,748 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-16 17:29:55,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:29:55,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:55,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:55,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1906124196, now seen corresponding path program 1 times [2024-11-16 17:29:55,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:55,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381055582] [2024-11-16 17:29:55,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:55,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:55,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:55,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:55,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:55,859 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-16 17:29:55,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:55,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381055582] [2024-11-16 17:29:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381055582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:55,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:55,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:29:55,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823222999] [2024-11-16 17:29:55,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:55,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:29:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:29:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:29:55,861 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-16 17:29:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:55,924 INFO L93 Difference]: Finished difference Result 409 states and 537 transitions. [2024-11-16 17:29:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:29:55,925 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-16 17:29:55,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:55,927 INFO L225 Difference]: With dead ends: 409 [2024-11-16 17:29:55,927 INFO L226 Difference]: Without dead ends: 266 [2024-11-16 17:29:55,928 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-16 17:29:55,929 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:29:55,929 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.0s Time] [2024-11-16 17:29:55,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-16 17:29:55,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 193. [2024-11-16 17:29:55,967 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-16 17:29:55,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 254 transitions. [2024-11-16 17:29:55,969 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 254 transitions. Word has length 66 [2024-11-16 17:29:55,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:55,969 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 254 transitions. [2024-11-16 17:29:55,969 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-16 17:29:55,969 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 254 transitions. [2024-11-16 17:29:55,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 17:29:55,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:55,970 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-16 17:29:55,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:29:55,971 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:55,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash -340893192, now seen corresponding path program 1 times [2024-11-16 17:29:55,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:55,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928103070] [2024-11-16 17:29:55,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,028 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-16 17:29:57,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:57,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928103070] [2024-11-16 17:29:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928103070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:57,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 17:29:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759149970] [2024-11-16 17:29:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:57,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:29:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:57,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:29:57,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:29:57,030 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-16 17:29:57,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:57,244 INFO L93 Difference]: Finished difference Result 340 states and 440 transitions. [2024-11-16 17:29:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 17:29:57,248 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-16 17:29:57,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:57,251 INFO L225 Difference]: With dead ends: 340 [2024-11-16 17:29:57,251 INFO L226 Difference]: Without dead ends: 245 [2024-11-16 17:29:57,255 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-16 17:29:57,257 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-16 17:29:57,260 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-16 17:29:57,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-16 17:29:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 199. [2024-11-16 17:29:57,293 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-16 17:29:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 262 transitions. [2024-11-16 17:29:57,294 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 262 transitions. Word has length 66 [2024-11-16 17:29:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:57,295 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 262 transitions. [2024-11-16 17:29:57,295 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-16 17:29:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 262 transitions. [2024-11-16 17:29:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-16 17:29:57,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:57,295 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-16 17:29:57,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 17:29:57,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:57,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash 546610489, now seen corresponding path program 1 times [2024-11-16 17:29:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967179403] [2024-11-16 17:29:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,448 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-16 17:29:57,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967179403] [2024-11-16 17:29:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967179403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:29:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512570135] [2024-11-16 17:29:57,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:57,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:29:57,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:29:57,450 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-16 17:29:57,453 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-16 17:29:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:57,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 17:29:57,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:29:57,655 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-16 17:29:57,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:29:57,750 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-16 17:29:57,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512570135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:29:57,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:29:57,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-16 17:29:57,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677878122] [2024-11-16 17:29:57,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:29:57,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 17:29:57,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:57,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 17:29:57,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:29:57,753 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-16 17:29:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:57,871 INFO L93 Difference]: Finished difference Result 320 states and 409 transitions. [2024-11-16 17:29:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 17:29:57,872 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-16 17:29:57,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:57,873 INFO L225 Difference]: With dead ends: 320 [2024-11-16 17:29:57,874 INFO L226 Difference]: Without dead ends: 124 [2024-11-16 17:29:57,874 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-16 17:29:57,875 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-16 17:29:57,875 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-16 17:29:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-16 17:29:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 112. [2024-11-16 17:29:57,888 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-16 17:29:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2024-11-16 17:29:57,889 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 66 [2024-11-16 17:29:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:57,890 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2024-11-16 17:29:57,890 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-16 17:29:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2024-11-16 17:29:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 17:29:57,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:57,895 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-16 17:29:57,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:29:58,098 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-16 17:29:58,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:58,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:58,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1809145017, now seen corresponding path program 1 times [2024-11-16 17:29:58,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:58,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648756028] [2024-11-16 17:29:58,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:29:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:29:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:29:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:29:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:29:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:29:58,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:29:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:29:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:29:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:58,327 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-16 17:29:58,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:58,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648756028] [2024-11-16 17:29:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648756028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:29:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:29:58,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:29:58,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994436884] [2024-11-16 17:29:58,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:29:58,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:29:58,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:29:58,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:29:58,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:29:58,329 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-16 17:29:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:29:58,417 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2024-11-16 17:29:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:29:58,418 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-16 17:29:58,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:29:58,419 INFO L225 Difference]: With dead ends: 229 [2024-11-16 17:29:58,419 INFO L226 Difference]: Without dead ends: 120 [2024-11-16 17:29:58,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:29:58,420 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.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:29:58,420 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.0s Time] [2024-11-16 17:29:58,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-16 17:29:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2024-11-16 17:29:58,447 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-16 17:29:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 120 transitions. [2024-11-16 17:29:58,448 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 120 transitions. Word has length 127 [2024-11-16 17:29:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:29:58,449 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 120 transitions. [2024-11-16 17:29:58,449 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-16 17:29:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 120 transitions. [2024-11-16 17:29:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-16 17:29:58,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:29:58,450 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-16 17:29:58,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 17:29:58,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:29:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:29:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1690554, now seen corresponding path program 1 times [2024-11-16 17:29:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:29:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636212356] [2024-11-16 17:29:58,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:29:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:29:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 17:29:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:29:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 17:29:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:29:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 17:29:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:29:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:29:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:29:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 17:29:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 17:29:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:29:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 17:29:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:29:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 17:29:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:29:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 17:29:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:29:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,636 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-16 17:29:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:29:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636212356] [2024-11-16 17:29:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636212356] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:29:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184011137] [2024-11-16 17:29:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:29:59,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:29:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:29:59,638 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-16 17:29:59,641 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-16 17:29:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:29:59,708 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 17:29:59,712 INFO L278 TraceCheckSpWp]: Computing forward predicates...