./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.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 d964adfd28c767eded8fdfbce722a54e84eb80fd1e317a796a69a672aa367725 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:41:40,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:41:40,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:41:40,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:41:40,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:41:40,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:41:40,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:41:40,598 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:41:40,599 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:41:40,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:41:40,600 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:41:40,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:41:40,601 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:41:40,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:41:40,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:41:40,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:41:40,603 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:41:40,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:41:40,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:41:40,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:41:40,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:41:40,605 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:41:40,605 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:41:40,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:41:40,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:41:40,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:41:40,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:41:40,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:41:40,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:41:40,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:41:40,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:41:40,608 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:41:40,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:40,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:41:40,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:41:40,615 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:41:40,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:41:40,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:41:40,616 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:41:40,616 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:41:40,616 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:41:40,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:41:40,618 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 -> d964adfd28c767eded8fdfbce722a54e84eb80fd1e317a796a69a672aa367725 [2024-11-08 21:41:40,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:41:40,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:41:40,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:41:40,924 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:41:40,924 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:41:40,926 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2024-11-08 21:41:42,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:41:42,709 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:41:42,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2024-11-08 21:41:42,719 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042944144/d53d148e7f2b48e4a91f9423ee68a02a/FLAGe6f25031c [2024-11-08 21:41:43,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042944144/d53d148e7f2b48e4a91f9423ee68a02a [2024-11-08 21:41:43,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:41:43,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:41:43,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:43,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:41:43,083 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:41:43,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4102c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43, skipping insertion in model container [2024-11-08 21:41:43,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:41:43,334 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i[919,932] [2024-11-08 21:41:43,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:43,410 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:41:43,420 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i[919,932] [2024-11-08 21:41:43,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:41:43,486 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:41:43,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43 WrapperNode [2024-11-08 21:41:43,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:41:43,488 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:43,488 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:41:43,488 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:41:43,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,552 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-08 21:41:43,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:41:43,553 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:41:43,553 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:41:43,553 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:41:43,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,587 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 21:41:43,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,602 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,626 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:41:43,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:41:43,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:41:43,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:41:43,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (1/1) ... [2024-11-08 21:41:43,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:41:43,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:41:43,675 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 21:41:43,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 21:41:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:41:43,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:41:43,733 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:41:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:41:43,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:41:43,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:41:43,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:41:43,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:41:44,239 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-08 21:41:44,240 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:41:44,256 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:41:44,256 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:41:44,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:44 BoogieIcfgContainer [2024-11-08 21:41:44,257 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:41:44,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:41:44,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:41:44,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:41:44,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:41:43" (1/3) ... [2024-11-08 21:41:44,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4ef02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:44, skipping insertion in model container [2024-11-08 21:41:44,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:41:43" (2/3) ... [2024-11-08 21:41:44,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4ef02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:41:44, skipping insertion in model container [2024-11-08 21:41:44,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:41:44" (3/3) ... [2024-11-08 21:41:44,266 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2024-11-08 21:41:44,282 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:41:44,282 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:41:44,349 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:41:44,355 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;@78559c59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:41:44,355 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:41:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:41:44,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:44,374 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:44,375 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:44,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash -150771443, now seen corresponding path program 1 times [2024-11-08 21:41:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:44,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077059966] [2024-11-08 21:41:44,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:44,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:41:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:41:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:41:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:41:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:41:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:41:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:41:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:41:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:44,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:44,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:41:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:41:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:41:44,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:44,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:44,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:44,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077059966] [2024-11-08 21:41:44,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077059966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:44,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:44,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:41:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097819271] [2024-11-08 21:41:44,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:44,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:41:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:44,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:41:44,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:45,000 INFO L87 Difference]: Start difference. First operand has 89 states, 60 states have (on average 1.45) internal successors, (87), 61 states have internal predecessors, (87), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:45,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:45,094 INFO L93 Difference]: Finished difference Result 169 states and 294 transitions. [2024-11-08 21:41:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:41:45,103 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2024-11-08 21:41:45,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:45,111 INFO L225 Difference]: With dead ends: 169 [2024-11-08 21:41:45,111 INFO L226 Difference]: Without dead ends: 83 [2024-11-08 21:41:45,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:41:45,122 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:45,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:41:45,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-08 21:41:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-08 21:41:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.3272727272727274) internal successors, (73), 55 states have internal predecessors, (73), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-08 21:41:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-08 21:41:45,179 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 170 [2024-11-08 21:41:45,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:45,179 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-08 21:41:45,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-08 21:41:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-08 21:41:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:41:45,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:45,185 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:45,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:41:45,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:45,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:45,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1813696819, now seen corresponding path program 1 times [2024-11-08 21:41:45,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:45,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551629681] [2024-11-08 21:41:45,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:41:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:41:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:41:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:41:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:41:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:41:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:46,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:41:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:41:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:41:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:41:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:41:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:46,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:46,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551629681] [2024-11-08 21:41:46,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551629681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:46,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:46,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:46,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472143179] [2024-11-08 21:41:46,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:46,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:46,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:46,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:46,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:46,424 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:46,874 INFO L93 Difference]: Finished difference Result 249 states and 379 transitions. [2024-11-08 21:41:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:46,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 170 [2024-11-08 21:41:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:46,879 INFO L225 Difference]: With dead ends: 249 [2024-11-08 21:41:46,880 INFO L226 Difference]: Without dead ends: 169 [2024-11-08 21:41:46,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:46,882 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 90 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:46,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 302 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:41:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-08 21:41:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2024-11-08 21:41:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 99 states have (on average 1.3131313131313131) internal successors, (130), 99 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:41:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2024-11-08 21:41:46,939 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 170 [2024-11-08 21:41:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:46,940 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2024-11-08 21:41:46,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2024-11-08 21:41:46,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 21:41:46,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:46,947 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:46,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:41:46,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:46,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1069351266, now seen corresponding path program 1 times [2024-11-08 21:41:46,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:46,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383856988] [2024-11-08 21:41:46,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:46,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:41:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:41:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:41:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:41:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:41:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:41:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:41:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:41:47,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:41:47,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:41:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:41:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:47,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383856988] [2024-11-08 21:41:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383856988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:41:47,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470595023] [2024-11-08 21:41:47,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:47,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:41:47,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:47,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:41:47,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:41:47,335 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:47,582 INFO L93 Difference]: Finished difference Result 267 states and 402 transitions. [2024-11-08 21:41:47,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:41:47,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-11-08 21:41:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:47,587 INFO L225 Difference]: With dead ends: 267 [2024-11-08 21:41:47,588 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 21:41:47,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:41:47,591 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 87 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:47,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 311 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:41:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 21:41:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 155. [2024-11-08 21:41:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 100 states have (on average 1.3) internal successors, (130), 100 states have internal predecessors, (130), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 21:41:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 234 transitions. [2024-11-08 21:41:47,626 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 234 transitions. Word has length 171 [2024-11-08 21:41:47,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:47,627 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 234 transitions. [2024-11-08 21:41:47,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 234 transitions. [2024-11-08 21:41:47,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:41:47,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:47,631 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:47,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:41:47,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:47,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:47,633 INFO L85 PathProgramCache]: Analyzing trace with hash 400266568, now seen corresponding path program 1 times [2024-11-08 21:41:47,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:47,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100941350] [2024-11-08 21:41:47,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:47,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:41:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:41:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:41:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 21:41:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:41:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 21:41:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:41:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 21:41:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:41:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 21:41:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:41:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 21:41:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 21:41:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:41:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 21:41:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:41:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 21:41:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 21:41:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 21:41:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:41:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 21:41:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 21:41:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 21:41:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 21:41:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 21:41:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 21:41:50,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:41:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-08 21:41:50,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:41:50,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100941350] [2024-11-08 21:41:50,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100941350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:41:50,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:41:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 21:41:50,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60172480] [2024-11-08 21:41:50,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:41:50,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:41:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:41:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:41:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:41:50,879 INFO L87 Difference]: Start difference. First operand 155 states and 234 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:41:52,570 INFO L93 Difference]: Finished difference Result 388 states and 565 transitions. [2024-11-08 21:41:52,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 21:41:52,571 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-11-08 21:41:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:41:52,574 INFO L225 Difference]: With dead ends: 388 [2024-11-08 21:41:52,574 INFO L226 Difference]: Without dead ends: 302 [2024-11-08 21:41:52,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:41:52,576 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 355 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:41:52,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 896 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 21:41:52,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-08 21:41:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 221. [2024-11-08 21:41:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 147 states have internal predecessors, (189), 71 states have call successors, (71), 3 states have call predecessors, (71), 3 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-08 21:41:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 331 transitions. [2024-11-08 21:41:52,616 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 331 transitions. Word has length 172 [2024-11-08 21:41:52,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:41:52,617 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 331 transitions. [2024-11-08 21:41:52,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-08 21:41:52,618 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 331 transitions. [2024-11-08 21:41:52,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-08 21:41:52,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:41:52,620 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:41:52,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:41:52,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:41:52,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:41:52,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1101331146, now seen corresponding path program 1 times [2024-11-08 21:41:52,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:41:52,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066084991] [2024-11-08 21:41:52,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:41:52,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:41:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat