./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_codestructure_dependencies_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-58.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a997cf687e351b7f57245bd31acb8cec29ed906aad11e6b7eee545da7afcb34c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:10:39,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:10:40,031 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:10:40,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:10:40,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:10:40,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:10:40,060 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:10:40,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:10:40,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:10:40,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:10:40,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:10:40,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:10:40,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:10:40,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:10:40,066 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:10:40,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:10:40,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:10:40,066 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:10:40,066 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:10:40,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:10:40,068 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:10:40,068 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:10:40,068 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:10:40,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:10:40,069 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:10:40,069 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:10:40,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:10:40,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:10:40,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:10:40,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:10:40,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:10:40,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:10:40,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:10:40,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:10:40,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:10:40,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:10:40,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a997cf687e351b7f57245bd31acb8cec29ed906aad11e6b7eee545da7afcb34c [2024-10-11 07:10:40,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:10:40,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:10:40,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:10:40,293 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:10:40,294 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:10:40,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-58.i [2024-10-11 07:10:41,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:10:41,634 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:10:41,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-58.i [2024-10-11 07:10:41,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a258a71b/bea87a6b8f4e411dba08b2e3a992aa2d/FLAGfd57d262f [2024-10-11 07:10:41,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a258a71b/bea87a6b8f4e411dba08b2e3a992aa2d [2024-10-11 07:10:41,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:10:41,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:10:41,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:10:41,664 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:10:41,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:10:41,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:41,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5428194c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41, skipping insertion in model container [2024-10-11 07:10:41,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:41,688 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:10:41,815 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_codestructure_dependencies_file-58.i[919,932] [2024-10-11 07:10:41,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:10:41,870 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:10:41,882 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_codestructure_dependencies_file-58.i[919,932] [2024-10-11 07:10:41,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:10:41,941 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:10:41,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41 WrapperNode [2024-10-11 07:10:41,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:10:41,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:10:41,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:10:41,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:10:41,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:41,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:41,995 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-11 07:10:41,995 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:10:41,998 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:10:41,998 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:10:41,998 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:10:42,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,012 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,031 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:10:42,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,050 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:10:42,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:10:42,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:10:42,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:10:42,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (1/1) ... [2024-10-11 07:10:42,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:10:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:10:42,079 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:10:42,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:10:42,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:10:42,120 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:10:42,120 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:10:42,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:10:42,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:10:42,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:10:42,195 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:10:42,199 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:10:42,496 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:10:42,496 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:10:42,534 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:10:42,535 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:10:42,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:10:42 BoogieIcfgContainer [2024-10-11 07:10:42,535 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:10:42,538 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:10:42,538 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:10:42,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:10:42,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:10:41" (1/3) ... [2024-10-11 07:10:42,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bb6050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:10:42, skipping insertion in model container [2024-10-11 07:10:42,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:10:41" (2/3) ... [2024-10-11 07:10:42,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9bb6050 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:10:42, skipping insertion in model container [2024-10-11 07:10:42,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:10:42" (3/3) ... [2024-10-11 07:10:42,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-58.i [2024-10-11 07:10:42,556 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:10:42,556 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:10:42,610 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:10:42,615 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;@22a9125d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:10:42,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:10:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 07:10:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 07:10:42,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:10:42,633 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:10:42,634 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:10:42,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:10:42,637 INFO L85 PathProgramCache]: Analyzing trace with hash 218277884, now seen corresponding path program 1 times [2024-10-11 07:10:42,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:10:42,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509685073] [2024-10-11 07:10:42,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:10:42,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:10:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 07:11:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:11:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:11:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:11:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:11:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:11:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:11:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:11:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:11:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:11:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:11:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:11:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:11:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:11:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:11:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:11:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:11:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:11:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:11:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:11:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 07:11:17,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:17,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509685073] [2024-10-11 07:11:17,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509685073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:17,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:17,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:11:17,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002198554] [2024-10-11 07:11:17,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:17,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:11:17,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:17,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:11:17,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:11:17,446 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 07:11:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:21,588 INFO L93 Difference]: Finished difference Result 289 states and 531 transitions. [2024-10-11 07:11:21,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 07:11:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-11 07:11:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:21,602 INFO L225 Difference]: With dead ends: 289 [2024-10-11 07:11:21,602 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 07:11:21,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=249, Invalid=507, Unknown=0, NotChecked=0, Total=756 [2024-10-11 07:11:21,609 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 285 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:21,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 457 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 07:11:21,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 07:11:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 145. [2024-10-11 07:11:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.4111111111111112) internal successors, (127), 91 states have internal predecessors, (127), 51 states have call successors, (51), 3 states have call predecessors, (51), 3 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 07:11:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 229 transitions. [2024-10-11 07:11:21,686 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 229 transitions. Word has length 144 [2024-10-11 07:11:21,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:21,688 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 229 transitions. [2024-10-11 07:11:21,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 07:11:21,688 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 229 transitions. [2024-10-11 07:11:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 07:11:21,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:21,691 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:11:21,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:11:21,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:21,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:21,693 INFO L85 PathProgramCache]: Analyzing trace with hash 898336254, now seen corresponding path program 1 times [2024-10-11 07:11:21,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:21,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000492622] [2024-10-11 07:11:21,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:21,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 07:11:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:21,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:11:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:11:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:11:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:11:21,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:11:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:11:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:11:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:11:21,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:11:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:11:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:11:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:11:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:11:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:11:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:11:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:11:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:11:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:11:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:11:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 07:11:21,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:11:21,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000492622] [2024-10-11 07:11:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000492622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:11:21,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:11:21,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 07:11:21,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124447492] [2024-10-11 07:11:21,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:11:21,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 07:11:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:11:21,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 07:11:21,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 07:11:21,958 INFO L87 Difference]: Start difference. First operand 145 states and 229 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 07:11:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:11:22,115 INFO L93 Difference]: Finished difference Result 353 states and 554 transitions. [2024-10-11 07:11:22,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:11:22,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 144 [2024-10-11 07:11:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:11:22,122 INFO L225 Difference]: With dead ends: 353 [2024-10-11 07:11:22,123 INFO L226 Difference]: Without dead ends: 209 [2024-10-11 07:11:22,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:11:22,127 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 98 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:11:22,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 274 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:11:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-10-11 07:11:22,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 201. [2024-10-11 07:11:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 122 states have internal predecessors, (168), 75 states have call successors, (75), 4 states have call predecessors, (75), 4 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 07:11:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 318 transitions. [2024-10-11 07:11:22,166 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 318 transitions. Word has length 144 [2024-10-11 07:11:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:11:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 318 transitions. [2024-10-11 07:11:22,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 07:11:22,167 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 318 transitions. [2024-10-11 07:11:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 07:11:22,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:11:22,173 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:11:22,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:11:22,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:11:22,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:11:22,174 INFO L85 PathProgramCache]: Analyzing trace with hash -876671108, now seen corresponding path program 1 times [2024-10-11 07:11:22,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:11:22,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702946751] [2024-10-11 07:11:22,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:11:22,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:11:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:11:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:11:59,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 07:11:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:11:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 07:11:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:11:59,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 07:11:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:11:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 07:11:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:11:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:11:59,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:11:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 07:11:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:11:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 07:11:59,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:11:59,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:11:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 07:12:00,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:12:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 07:12:00,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:12:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 07:12:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:12:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 07:12:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:12:00,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:12:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 07:12:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:12:00,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702946751] [2024-10-11 07:12:00,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702946751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:12:00,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:12:00,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 07:12:00,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869667320] [2024-10-11 07:12:00,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:12:00,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 07:12:00,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:12:00,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 07:12:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 07:12:00,021 INFO L87 Difference]: Start difference. First operand 201 states and 318 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 07:12:03,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:12:03,044 INFO L93 Difference]: Finished difference Result 298 states and 443 transitions. [2024-10-11 07:12:03,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 07:12:03,044 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 144 [2024-10-11 07:12:03,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:12:03,046 INFO L225 Difference]: With dead ends: 298 [2024-10-11 07:12:03,046 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 07:12:03,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=232, Invalid=470, Unknown=0, NotChecked=0, Total=702 [2024-10-11 07:12:03,048 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 378 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 07:12:03,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 377 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 07:12:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 07:12:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 194. [2024-10-11 07:12:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 113 states have (on average 1.345132743362832) internal successors, (152), 114 states have internal predecessors, (152), 75 states have call successors, (75), 5 states have call predecessors, (75), 5 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2024-10-11 07:12:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 302 transitions. [2024-10-11 07:12:03,084 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 302 transitions. Word has length 144 [2024-10-11 07:12:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:12:03,085 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 302 transitions. [2024-10-11 07:12:03,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-10-11 07:12:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 302 transitions. [2024-10-11 07:12:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 07:12:03,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:12:03,088 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:12:03,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:12:03,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:12:03,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:12:03,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1823961112, now seen corresponding path program 1 times [2024-10-11 07:12:03,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:12:03,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549922671] [2024-10-11 07:12:03,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:12:03,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:12:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat