./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.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 d49e82c63c2bb2c50317e322b05c62ce756ce2b0f76f53e25c5542bb842ee0fc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:06:18,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:06:18,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:06:18,934 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:06:18,935 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:06:18,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:06:18,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:06:18,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:06:18,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:06:18,961 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:06:18,961 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:06:18,962 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:06:18,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:06:18,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:06:18,964 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:06:18,964 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:06:18,964 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:06:18,964 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:06:18,965 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:06:18,965 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:06:18,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:06:18,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:06:18,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:06:18,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:06:18,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:06:18,969 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:06:18,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:06:18,969 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:06:18,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:06:18,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:06:18,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:06:18,970 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:06:18,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:06:18,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:06:18,971 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:06:18,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:06:18,973 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 -> d49e82c63c2bb2c50317e322b05c62ce756ce2b0f76f53e25c5542bb842ee0fc [2024-10-24 10:06:19,169 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:06:19,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:06:19,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:06:19,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:06:19,198 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:06:19,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i [2024-10-24 10:06:20,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:06:20,617 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:06:20,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i [2024-10-24 10:06:20,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4005a38d/d975ddc6bdab44148636f4f0aad60924/FLAG62477d63a [2024-10-24 10:06:20,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4005a38d/d975ddc6bdab44148636f4f0aad60924 [2024-10-24 10:06:20,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:06:20,643 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:06:20,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:06:20,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:06:20,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:06:20,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:06:20" (1/1) ... [2024-10-24 10:06:20,651 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d851c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:20, skipping insertion in model container [2024-10-24 10:06:20,651 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:06:20" (1/1) ... [2024-10-24 10:06:20,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:06:20,845 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i[915,928] [2024-10-24 10:06:20,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:06:20,940 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:06:20,953 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-1.i[915,928] [2024-10-24 10:06:20,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:06:21,007 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:06:21,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21 WrapperNode [2024-10-24 10:06:21,008 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:06:21,009 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:06:21,009 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:06:21,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:06:21,015 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,028 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,065 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 260 [2024-10-24 10:06:21,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:06:21,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:06:21,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:06:21,067 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:06:21,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,114 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:06:21,114 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,114 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,139 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,155 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:06:21,157 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:06:21,157 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:06:21,157 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:06:21,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (1/1) ... [2024-10-24 10:06:21,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:06:21,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:06:21,187 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-10-24 10:06:21,190 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-10-24 10:06:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:06:21,227 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:06:21,227 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:06:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:06:21,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:06:21,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:06:21,298 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:06:21,300 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:06:21,762 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2024-10-24 10:06:21,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:06:21,796 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:06:21,798 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:06:21,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:06:21 BoogieIcfgContainer [2024-10-24 10:06:21,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:06:21,800 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:06:21,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:06:21,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:06:21,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:06:20" (1/3) ... [2024-10-24 10:06:21,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c88856d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:06:21, skipping insertion in model container [2024-10-24 10:06:21,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:06:21" (2/3) ... [2024-10-24 10:06:21,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c88856d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:06:21, skipping insertion in model container [2024-10-24 10:06:21,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:06:21" (3/3) ... [2024-10-24 10:06:21,806 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-1.i [2024-10-24 10:06:21,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:06:21,819 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:06:21,870 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:06:21,876 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;@4ae0b0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:06:21,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:06:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-24 10:06:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-10-24 10:06:21,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:06:21,897 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:06:21,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:06:21,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:06:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 73095227, now seen corresponding path program 1 times [2024-10-24 10:06:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:06:21,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560941937] [2024-10-24 10:06:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:06:21,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:06:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:06:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:06:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:06:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:06:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:06:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:06:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:06:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:06:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:06:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:06:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:06:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:06:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:06:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:06:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:06:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 10:06:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 10:06:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 10:06:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 10:06:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 10:06:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:06:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:06:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 10:06:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 10:06:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 10:06:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 10:06:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 10:06:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 10:06:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 10:06:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 10:06:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 10:06:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 10:06:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 10:06:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 10:06:22,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:06:22,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560941937] [2024-10-24 10:06:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560941937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:06:22,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:06:22,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:06:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084110977] [2024-10-24 10:06:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:06:22,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:06:22,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:06:22,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:06:22,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:06:22,733 INFO L87 Difference]: Start difference. First operand has 110 states, 74 states have (on average 1.5) internal successors, (111), 75 states have internal predecessors, (111), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 10:06:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:06:22,829 INFO L93 Difference]: Finished difference Result 324 states and 593 transitions. [2024-10-24 10:06:22,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:06:22,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-10-24 10:06:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:06:22,842 INFO L225 Difference]: With dead ends: 324 [2024-10-24 10:06:22,843 INFO L226 Difference]: Without dead ends: 215 [2024-10-24 10:06:22,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:06:22,851 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 104 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:06:22,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 497 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:06:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-10-24 10:06:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2024-10-24 10:06:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.4513888888888888) internal successors, (209), 144 states have internal predecessors, (209), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 66 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 10:06:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 341 transitions. [2024-10-24 10:06:22,933 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 341 transitions. Word has length 209 [2024-10-24 10:06:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:06:22,936 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 341 transitions. [2024-10-24 10:06:22,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 10:06:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 341 transitions. [2024-10-24 10:06:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 10:06:22,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:06:22,942 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:06:22,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:06:22,943 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:06:22,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:06:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash 406007518, now seen corresponding path program 1 times [2024-10-24 10:06:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:06:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193976932] [2024-10-24 10:06:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:06:22,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:06:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:06:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:06:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:06:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:06:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:06:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:06:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:06:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:06:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:06:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:06:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:06:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:06:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:06:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:06:23,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:06:23,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 10:06:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 10:06:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 10:06:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 10:06:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 10:06:23,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:06:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:06:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 10:06:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 10:06:23,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 10:06:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 10:06:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 10:06:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 10:06:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 10:06:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 10:06:23,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 10:06:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 10:06:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 10:06:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-10-24 10:06:23,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:06:23,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193976932] [2024-10-24 10:06:23,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193976932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:06:23,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:06:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:06:23,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898140433] [2024-10-24 10:06:23,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:06:23,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:06:23,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:06:23,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:06:23,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:06:23,787 INFO L87 Difference]: Start difference. First operand 213 states and 341 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 10:06:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:06:24,052 INFO L93 Difference]: Finished difference Result 533 states and 846 transitions. [2024-10-24 10:06:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:06:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-10-24 10:06:24,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:06:24,056 INFO L225 Difference]: With dead ends: 533 [2024-10-24 10:06:24,056 INFO L226 Difference]: Without dead ends: 321 [2024-10-24 10:06:24,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:06:24,059 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 81 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 10:06:24,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 463 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 10:06:24,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-24 10:06:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 317. [2024-10-24 10:06:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 224 states have (on average 1.4508928571428572) internal successors, (325), 226 states have internal predecessors, (325), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 86 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-24 10:06:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 501 transitions. [2024-10-24 10:06:24,106 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 501 transitions. Word has length 210 [2024-10-24 10:06:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:06:24,107 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 501 transitions. [2024-10-24 10:06:24,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-10-24 10:06:24,108 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 501 transitions. [2024-10-24 10:06:24,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-24 10:06:24,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:06:24,111 INFO L215 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:06:24,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:06:24,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:06:24,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:06:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash -274050852, now seen corresponding path program 1 times [2024-10-24 10:06:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:06:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958779349] [2024-10-24 10:06:24,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:06:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:06:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:06:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:06:29,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:06:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:06:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:06:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:06:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:06:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 10:06:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 10:06:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 10:06:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 10:06:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 10:06:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 10:06:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 10:06:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 10:06:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 10:06:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:29,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 10:06:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 10:06:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 10:06:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 10:06:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 10:06:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 10:06:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 10:06:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-24 10:06:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 10:06:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-24 10:06:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 10:06:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-24 10:06:30,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 10:06:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 10:06:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 10:06:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 10:06:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-24 10:06:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 345 proven. 255 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-24 10:06:30,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:06:30,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958779349] [2024-10-24 10:06:30,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958779349] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:06:30,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047915900] [2024-10-24 10:06:30,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:06:30,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:06:30,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:06:30,221 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-10-24 10:06:30,222 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-10-24 10:06:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:06:30,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-24 10:06:30,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:06:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1555 proven. 246 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2024-10-24 10:06:38,290 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:06:48,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047915900] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:06:48,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:06:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 38 [2024-10-24 10:06:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079245079] [2024-10-24 10:06:48,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:06:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-10-24 10:06:48,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:06:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-10-24 10:06:48,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1686, Unknown=3, NotChecked=0, Total=1892 [2024-10-24 10:06:48,368 INFO L87 Difference]: Start difference. First operand 317 states and 501 transitions. Second operand has 38 states, 36 states have (on average 3.3055555555555554) internal successors, (119), 37 states have internal predecessors, (119), 16 states have call successors, (66), 7 states have call predecessors, (66), 13 states have return successors, (66), 16 states have call predecessors, (66), 16 states have call successors, (66) [2024-10-24 10:07:12,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:16,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:24,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:28,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:32,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:36,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:43,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:48,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:52,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2024-10-24 10:07:56,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0]