./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-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.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 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:19:41,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:19:41,648 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:19:41,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:19:41,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:19:41,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:19:41,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:19:41,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:19:41,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:19:41,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:19:41,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:19:41,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:19:41,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:19:41,690 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:19:41,691 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:19:41,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:19:41,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:19:41,692 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:19:41,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:19:41,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:19:41,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:19:41,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:19:41,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:19:41,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:19:41,696 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:19:41,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:19:41,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:19:41,697 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:19:41,697 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:19:41,697 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:19:41,698 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:19:41,698 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:19:41,698 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:19:41,699 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:19:41,699 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:19:41,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:19:41,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:19:41,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:19:41,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:19:41,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:19:41,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:19:41,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:19:41,703 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 -> 07d06a1bebc1511c3a46b4e9a64f66f9738b27692a36c7a7c5ca717a01250a89 [2024-10-14 07:19:41,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:19:42,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:19:42,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:19:42,010 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:19:42,010 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:19:42,011 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2024-10-14 07:19:43,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:19:43,677 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:19:43,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-59.i [2024-10-14 07:19:43,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2692dfab2/80e7b2ef26d14a319cc288141465bca4/FLAGbddc0bc6c [2024-10-14 07:19:44,051 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2692dfab2/80e7b2ef26d14a319cc288141465bca4 [2024-10-14 07:19:44,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:19:44,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:19:44,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:19:44,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:19:44,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:19:44,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2290c270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44, skipping insertion in model container [2024-10-14 07:19:44,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:19:44,252 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-59.i[919,932] [2024-10-14 07:19:44,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:19:44,336 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:19:44,350 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-59.i[919,932] [2024-10-14 07:19:44,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:19:44,404 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:19:44,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44 WrapperNode [2024-10-14 07:19:44,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:19:44,406 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:19:44,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:19:44,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:19:44,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,461 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-14 07:19:44,465 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:19:44,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:19:44,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:19:44,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:19:44,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,508 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-14 07:19:44,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,524 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,537 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:19:44,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:19:44,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:19:44,546 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:19:44,547 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (1/1) ... [2024-10-14 07:19:44,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:19:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:19:44,577 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 07:19:44,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 07:19:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:19:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:19:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:19:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:19:44,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:19:44,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:19:44,704 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:19:44,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:19:45,103 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 07:19:45,104 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:19:45,153 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:19:45,153 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:19:45,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:19:45 BoogieIcfgContainer [2024-10-14 07:19:45,154 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:19:45,156 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:19:45,156 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:19:45,160 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:19:45,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:19:44" (1/3) ... [2024-10-14 07:19:45,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed719f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:19:45, skipping insertion in model container [2024-10-14 07:19:45,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:44" (2/3) ... [2024-10-14 07:19:45,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed719f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:19:45, skipping insertion in model container [2024-10-14 07:19:45,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:19:45" (3/3) ... [2024-10-14 07:19:45,163 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-59.i [2024-10-14 07:19:45,178 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:19:45,179 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:19:45,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:19:45,233 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;@e8b09b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:19:45,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:19:45,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 07:19:45,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 07:19:45,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:19:45,248 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:19:45,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:19:45,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:19:45,252 INFO L85 PathProgramCache]: Analyzing trace with hash -329780676, now seen corresponding path program 1 times [2024-10-14 07:19:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:19:45,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794085692] [2024-10-14 07:19:45,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:45,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:19:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:19:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:19:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:19:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:19:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:19:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:19:45,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:19:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:19:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:19:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:19:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:19:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:19:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:19:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:19:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:45,608 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 07:19:45,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:19:45,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794085692] [2024-10-14 07:19:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794085692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:19:45,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:19:45,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:19:45,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677320531] [2024-10-14 07:19:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:19:45,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:19:45,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:19:45,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:19:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:19:45,648 INFO L87 Difference]: Start difference. First operand has 46 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 30 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 07:19:45,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:19:45,697 INFO L93 Difference]: Finished difference Result 89 states and 156 transitions. [2024-10-14 07:19:45,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:19:45,701 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 89 [2024-10-14 07:19:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:19:45,710 INFO L225 Difference]: With dead ends: 89 [2024-10-14 07:19:45,710 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 07:19:45,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-14 07:19:45,720 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:19:45,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:19:45,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 07:19:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 07:19:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 07:19:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 67 transitions. [2024-10-14 07:19:45,763 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 67 transitions. Word has length 89 [2024-10-14 07:19:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:19:45,764 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 67 transitions. [2024-10-14 07:19:45,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 07:19:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 67 transitions. [2024-10-14 07:19:45,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 07:19:45,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:19:45,768 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:19:45,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:19:45,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:19:45,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:19:45,769 INFO L85 PathProgramCache]: Analyzing trace with hash 366706820, now seen corresponding path program 1 times [2024-10-14 07:19:45,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:19:45,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652422734] [2024-10-14 07:19:45,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:45,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:19:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:19:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:19:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:19:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:19:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:19:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:19:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:19:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:19:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:19:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:19:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:19:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:19:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:19:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:19:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 07:19:46,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:19:46,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652422734] [2024-10-14 07:19:46,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652422734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:19:46,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:19:46,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:19:46,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662250897] [2024-10-14 07:19:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:19:46,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:19:46,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:19:46,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:19:46,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:19:46,368 INFO L87 Difference]: Start difference. First operand 44 states and 67 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 07:19:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:19:46,514 INFO L93 Difference]: Finished difference Result 131 states and 200 transitions. [2024-10-14 07:19:46,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:19:46,516 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 89 [2024-10-14 07:19:46,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:19:46,520 INFO L225 Difference]: With dead ends: 131 [2024-10-14 07:19:46,520 INFO L226 Difference]: Without dead ends: 88 [2024-10-14 07:19:46,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:19:46,523 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 45 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:19:46,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 188 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:19:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-14 07:19:46,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2024-10-14 07:19:46,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-14 07:19:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 108 transitions. [2024-10-14 07:19:46,554 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 108 transitions. Word has length 89 [2024-10-14 07:19:46,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:19:46,555 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 108 transitions. [2024-10-14 07:19:46,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 07:19:46,555 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 108 transitions. [2024-10-14 07:19:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 07:19:46,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:19:46,559 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:19:46,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:19:46,560 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:19:46,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:19:46,560 INFO L85 PathProgramCache]: Analyzing trace with hash -687982848, now seen corresponding path program 1 times [2024-10-14 07:19:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:19:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392500912] [2024-10-14 07:19:46,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:19:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:19:46,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:19:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 07:19:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:19:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 07:19:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:19:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 07:19:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:19:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:19:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 07:19:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 07:19:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 07:19:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 07:19:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:19:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 07:19:46,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:19:46,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392500912] [2024-10-14 07:19:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392500912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:19:46,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:19:46,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:19:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128694081] [2024-10-14 07:19:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:19:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:19:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:19:46,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:19:46,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:19:46,954 INFO L87 Difference]: Start difference. First operand 72 states and 108 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 07:19:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:19:47,126 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2024-10-14 07:19:47,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:19:47,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 90 [2024-10-14 07:19:47,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:19:47,129 INFO L225 Difference]: With dead ends: 166 [2024-10-14 07:19:47,129 INFO L226 Difference]: Without dead ends: 123 [2024-10-14 07:19:47,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:19:47,135 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 58 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:19:47,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 186 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:19:47,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-14 07:19:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2024-10-14 07:19:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 07:19:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-10-14 07:19:47,174 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 90 [2024-10-14 07:19:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:19:47,175 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-10-14 07:19:47,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 07:19:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-10-14 07:19:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 07:19:47,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:19:47,177 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:19:47,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:19:47,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:19:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:19:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash 189903056, now seen corresponding path program 1 times [2024-10-14 07:19:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:19:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192572783] [2024-10-14 07:19:47,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:19:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:19:47,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389896714] [2024-10-14 07:19:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:47,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:19:47,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:19:47,324 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:19:47,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 07:19:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:47,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-14 07:19:47,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:19:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 169 proven. 105 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-14 07:19:49,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:19:56,372 WARN L286 SmtUtils]: Spent 5.94s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 07:20:09,164 WARN L286 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 07:20:14,479 WARN L286 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-14 07:20:32,903 WARN L286 SmtUtils]: Spent 13.78s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 07:20:43,645 WARN L286 SmtUtils]: Spent 6.67s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)