./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-45.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_codestructure_dependencies_file-45.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 3497bab21b5671016fc7010f5ecca5cf4e8910c607e99fc1f822ef0bd96d6ed2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:04:12,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:04:13,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:04:13,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:04:13,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:04:13,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:04:13,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:04:13,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:04:13,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:04:13,093 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:04:13,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:04:13,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:04:13,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:04:13,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:04:13,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:04:13,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:04:13,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:04:13,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:04:13,096 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:04:13,096 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:04:13,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:04:13,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:04:13,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:04:13,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:04:13,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:04:13,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:04:13,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:04:13,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:04:13,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:04:13,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:04:13,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:04:13,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:04:13,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:04:13,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:04:13,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:04:13,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:04:13,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:04:13,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:04:13,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:04:13,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:04:13,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:04:13,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:04:13,105 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 -> 3497bab21b5671016fc7010f5ecca5cf4e8910c607e99fc1f822ef0bd96d6ed2 [2024-11-16 12:04:13,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:04:13,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:04:13,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:04:13,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:04:13,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:04:13,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-45.i [2024-11-16 12:04:14,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:04:14,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:04:14,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-45.i [2024-11-16 12:04:14,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744e366a6/b720896e3fe044c9beb5149e145681bb/FLAGe6d63cf9a [2024-11-16 12:04:15,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/744e366a6/b720896e3fe044c9beb5149e145681bb [2024-11-16 12:04:15,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:04:15,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:04:15,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:04:15,262 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:04:15,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:04:15,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e18373a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15, skipping insertion in model container [2024-11-16 12:04:15,268 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:04:15,422 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_codestructure_dependencies_file-45.i[919,932] [2024-11-16 12:04:15,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:04:15,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:04:15,493 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_codestructure_dependencies_file-45.i[919,932] [2024-11-16 12:04:15,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:04:15,543 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:04:15,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15 WrapperNode [2024-11-16 12:04:15,543 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:04:15,544 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:04:15,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:04:15,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:04:15,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,579 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-16 12:04:15,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:04:15,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:04:15,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:04:15,580 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:04:15,589 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,589 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,613 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 12:04:15,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,622 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:04:15,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:04:15,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:04:15,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:04:15,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (1/1) ... [2024-11-16 12:04:15,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:04:15,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:04:15,658 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 12:04:15,660 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 12:04:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:04:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:04:15,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:04:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:04:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:04:15,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:04:15,757 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:04:15,759 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:04:15,963 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:04:15,964 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:04:15,979 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:04:15,980 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:04:15,980 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:04:15 BoogieIcfgContainer [2024-11-16 12:04:15,980 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:04:15,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:04:15,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:04:15,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:04:15,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:04:15" (1/3) ... [2024-11-16 12:04:15,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5222de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:04:15, skipping insertion in model container [2024-11-16 12:04:15,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:04:15" (2/3) ... [2024-11-16 12:04:15,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5222de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:04:15, skipping insertion in model container [2024-11-16 12:04:15,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:04:15" (3/3) ... [2024-11-16 12:04:15,992 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-45.i [2024-11-16 12:04:16,009 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:04:16,010 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:04:16,080 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:04:16,088 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;@bdde59b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:04:16,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:04:16,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:04:16,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 12:04:16,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:04:16,107 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:16,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:04:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:04:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 275953826, now seen corresponding path program 1 times [2024-11-16 12:04:16,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:04:16,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786413277] [2024-11-16 12:04:16,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:04:16,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:04:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:04:16,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:04:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:04:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:04:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:04:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:04:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:04:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:04:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:04:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:04:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:04:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:04:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:04:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:04:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:04:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:04:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,535 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:04:16,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:04:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786413277] [2024-11-16 12:04:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786413277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:04:16,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:04:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:04:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149198172] [2024-11-16 12:04:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:04:16,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:04:16,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:04:16,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:04:16,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:04:16,590 INFO L87 Difference]: Start difference. First operand has 58 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 40 states have internal predecessors, (54), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 12:04:16,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:04:16,619 INFO L93 Difference]: Finished difference Result 108 states and 181 transitions. [2024-11-16 12:04:16,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:04:16,640 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-11-16 12:04:16,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:04:16,646 INFO L225 Difference]: With dead ends: 108 [2024-11-16 12:04:16,647 INFO L226 Difference]: Without dead ends: 53 [2024-11-16 12:04:16,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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 12:04:16,654 INFO L432 NwaCegarLoop]: 77 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, 77 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 12:04:16,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:04:16,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-16 12:04:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-16 12:04:16,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:04:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 77 transitions. [2024-11-16 12:04:16,701 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 77 transitions. Word has length 107 [2024-11-16 12:04:16,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:04:16,703 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 77 transitions. [2024-11-16 12:04:16,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 12:04:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 77 transitions. [2024-11-16 12:04:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 12:04:16,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:04:16,706 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:16,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:04:16,706 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:04:16,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:04:16,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1656346462, now seen corresponding path program 1 times [2024-11-16 12:04:16,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:04:16,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046648885] [2024-11-16 12:04:16,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:04:16,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:04:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:04:16,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:04:16,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:04:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:04:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:04:16,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:04:16,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:04:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:04:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:04:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:04:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:04:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:04:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:04:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:04:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:04:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:04:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:04:16,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:04:16,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046648885] [2024-11-16 12:04:16,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046648885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:04:16,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:04:16,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:04:16,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177471458] [2024-11-16 12:04:16,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:04:16,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:04:16,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:04:16,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:04:16,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:04:16,976 INFO L87 Difference]: Start difference. First operand 53 states and 77 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:04:17,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:04:17,023 INFO L93 Difference]: Finished difference Result 150 states and 219 transitions. [2024-11-16 12:04:17,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:04:17,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-16 12:04:17,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:04:17,026 INFO L225 Difference]: With dead ends: 150 [2024-11-16 12:04:17,026 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 12:04:17,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:04:17,028 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 68 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:04:17,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 147 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:04:17,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 12:04:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-16 12:04:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 12:04:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 140 transitions. [2024-11-16 12:04:17,052 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 140 transitions. Word has length 107 [2024-11-16 12:04:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:04:17,057 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 140 transitions. [2024-11-16 12:04:17,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:04:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 140 transitions. [2024-11-16 12:04:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:04:17,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:04:17,058 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:17,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:04:17,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:04:17,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:04:17,059 INFO L85 PathProgramCache]: Analyzing trace with hash 558878846, now seen corresponding path program 1 times [2024-11-16 12:04:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:04:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607748136] [2024-11-16 12:04:17,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:04:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:04:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:04:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:04:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:04:38,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:04:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:04:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:04:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:04:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:04:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:04:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:04:38,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:04:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:04:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:04:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:04:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:04:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:04:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:04:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:04:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:04:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607748136] [2024-11-16 12:04:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607748136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:04:38,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:04:38,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 12:04:38,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798377772] [2024-11-16 12:04:38,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:04:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 12:04:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:04:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 12:04:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:04:38,777 INFO L87 Difference]: Start difference. First operand 97 states and 140 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:04:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:04:43,327 INFO L93 Difference]: Finished difference Result 316 states and 435 transitions. [2024-11-16 12:04:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 12:04:43,327 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-16 12:04:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:04:43,330 INFO L225 Difference]: With dead ends: 316 [2024-11-16 12:04:43,330 INFO L226 Difference]: Without dead ends: 222 [2024-11-16 12:04:43,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2024-11-16 12:04:43,331 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 162 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:04:43,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 468 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 12:04:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-16 12:04:43,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 159. [2024-11-16 12:04:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 116 states have internal predecessors, (143), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-16 12:04:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 223 transitions. [2024-11-16 12:04:43,351 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 223 transitions. Word has length 108 [2024-11-16 12:04:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:04:43,352 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 223 transitions. [2024-11-16 12:04:43,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:04:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 223 transitions. [2024-11-16 12:04:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:04:43,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:04:43,354 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:04:43,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:04:43,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:04:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:04:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1446382527, now seen corresponding path program 1 times [2024-11-16 12:04:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:04:43,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225314244] [2024-11-16 12:04:43,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:04:43,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:04:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat