./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_fillercodesize_ps-cn-25_file-45.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adf1aa5f21517d4164b2d2d35d8f1733abd14e0ec22c04a0786a83273c0faf00 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:19:18,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:19:18,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:19:18,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:19:18,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:19:18,897 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:19:18,898 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:19:18,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:19:18,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:19:18,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:19:18,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:19:18,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:19:18,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:19:18,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:19:18,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:19:18,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:19:18,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:19:18,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:19:18,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:19:18,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:19:18,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:19:18,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:19:18,908 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:19:18,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:19:18,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:19:18,909 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:19:18,909 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:19:18,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:19:18,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:19:18,910 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:19:18,910 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:19:18,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:19:18,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:19:18,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:19:18,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:19:18,911 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:19:18,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:19:18,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:19:18,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:19:18,912 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:19:18,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:19:18,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:19:18,913 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 -> adf1aa5f21517d4164b2d2d35d8f1733abd14e0ec22c04a0786a83273c0faf00 [2024-11-12 02:19:19,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:19:19,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:19:19,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:19:19,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:19:19,212 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:19:19,213 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-45.i [2024-11-12 02:19:20,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:19:20,939 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:19:20,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-45.i [2024-11-12 02:19:20,948 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51a78b4a/c31ec247e31f4ae6a755c189220b5e58/FLAGae6942e41 [2024-11-12 02:19:20,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c51a78b4a/c31ec247e31f4ae6a755c189220b5e58 [2024-11-12 02:19:20,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:19:20,966 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:19:20,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:19:20,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:19:20,973 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:19:20,974 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:20" (1/1) ... [2024-11-12 02:19:20,975 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb6b736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:20, skipping insertion in model container [2024-11-12 02:19:20,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:19:20" (1/1) ... [2024-11-12 02:19:21,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:19:21,195 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_fillercodesize_ps-cn-25_file-45.i[915,928] [2024-11-12 02:19:21,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:19:21,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:19:21,289 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_fillercodesize_ps-cn-25_file-45.i[915,928] [2024-11-12 02:19:21,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:19:21,388 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:19:21,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21 WrapperNode [2024-11-12 02:19:21,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:19:21,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:19:21,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:19:21,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:19:21,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,462 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-11-12 02:19:21,463 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:19:21,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:19:21,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:19:21,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:19:21,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,483 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,506 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-12 02:19:21,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:19:21,537 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:19:21,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:19:21,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:19:21,538 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (1/1) ... [2024-11-12 02:19:21,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:19:21,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:19:21,573 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-12 02:19:21,576 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-12 02:19:21,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:19:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:19:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:19:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:19:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:19:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:19:21,691 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:19:21,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:19:21,975 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 02:19:21,975 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:19:21,986 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:19:21,986 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:19:21,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:21 BoogieIcfgContainer [2024-11-12 02:19:21,986 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:19:21,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:19:21,988 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:19:21,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:19:21,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:19:20" (1/3) ... [2024-11-12 02:19:21,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e52c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:21, skipping insertion in model container [2024-11-12 02:19:21,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:19:21" (2/3) ... [2024-11-12 02:19:21,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e52c58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:19:21, skipping insertion in model container [2024-11-12 02:19:21,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:19:21" (3/3) ... [2024-11-12 02:19:21,993 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-45.i [2024-11-12 02:19:22,007 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:19:22,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:19:22,069 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:19:22,074 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;@3ed90262, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:19:22,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:19:22,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 55 states have internal predecessors, (72), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-12 02:19:22,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-12 02:19:22,090 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:22,091 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:19:22,092 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:22,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash 486984492, now seen corresponding path program 1 times [2024-11-12 02:19:22,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:22,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482315563] [2024-11-12 02:19:22,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:19:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:19:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:19:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:19:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:19:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:19:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:19:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:19:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:19:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:19:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:19:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:19:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:19:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:19:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 02:19:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-12 02:19:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 02:19:22,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:22,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482315563] [2024-11-12 02:19:22,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482315563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:22,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:22,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:19:22,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467157426] [2024-11-12 02:19:22,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:22,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:19:22,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:22,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:19:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:19:22,719 INFO L87 Difference]: Start difference. First operand has 88 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 55 states have internal predecessors, (72), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 02:19:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:22,836 INFO L93 Difference]: Finished difference Result 247 states and 446 transitions. [2024-11-12 02:19:22,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:19:22,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-11-12 02:19:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:22,852 INFO L225 Difference]: With dead ends: 247 [2024-11-12 02:19:22,852 INFO L226 Difference]: Without dead ends: 162 [2024-11-12 02:19:22,857 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:19:22,860 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 116 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:22,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 234 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:19:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-12 02:19:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2024-11-12 02:19:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-12 02:19:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 241 transitions. [2024-11-12 02:19:22,924 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 241 transitions. Word has length 198 [2024-11-12 02:19:22,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:22,925 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 241 transitions. [2024-11-12 02:19:22,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 02:19:22,926 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 241 transitions. [2024-11-12 02:19:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 02:19:22,929 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:22,929 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:19:22,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:19:22,929 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:22,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:22,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1806129276, now seen corresponding path program 1 times [2024-11-12 02:19:22,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:22,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031389330] [2024-11-12 02:19:22,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:22,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:19:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:19:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:19:36,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:19:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:19:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:19:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:19:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:19:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:19:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:19:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:19:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:19:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:19:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:19:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 02:19:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-12 02:19:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:36,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 02:19:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:36,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031389330] [2024-11-12 02:19:36,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031389330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:36,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:36,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:19:36,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355983081] [2024-11-12 02:19:36,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:36,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:19:36,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:36,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:19:36,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:36,666 INFO L87 Difference]: Start difference. First operand 160 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 02:19:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:37,132 INFO L93 Difference]: Finished difference Result 438 states and 644 transitions. [2024-11-12 02:19:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:19:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-12 02:19:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:37,137 INFO L225 Difference]: With dead ends: 438 [2024-11-12 02:19:37,138 INFO L226 Difference]: Without dead ends: 281 [2024-11-12 02:19:37,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:37,140 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 81 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:37,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 331 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 02:19:37,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-12 02:19:37,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2024-11-12 02:19:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 147 states have (on average 1.251700680272109) internal successors, (184), 149 states have internal predecessors, (184), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 02:19:37,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 340 transitions. [2024-11-12 02:19:37,210 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 340 transitions. Word has length 199 [2024-11-12 02:19:37,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:37,211 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 340 transitions. [2024-11-12 02:19:37,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 02:19:37,211 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 340 transitions. [2024-11-12 02:19:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 02:19:37,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:37,219 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:19:37,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:19:37,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:37,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:37,220 INFO L85 PathProgramCache]: Analyzing trace with hash 996782650, now seen corresponding path program 1 times [2024-11-12 02:19:37,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:37,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467764367] [2024-11-12 02:19:37,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:37,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:37,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:19:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:19:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:19:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:19:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:19:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:19:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:19:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:19:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 02:19:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:19:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 02:19:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 02:19:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 02:19:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 02:19:38,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 02:19:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 02:19:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 02:19:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 02:19:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 02:19:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 02:19:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:19:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:38,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:19:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 02:19:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:19:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 02:19:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 02:19:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 02:19:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 02:19:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 02:19:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 02:19:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-12 02:19:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:19:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-12 02:19:39,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:19:39,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467764367] [2024-11-12 02:19:39,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467764367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:19:39,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:19:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:19:39,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068998766] [2024-11-12 02:19:39,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:19:39,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:19:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:19:39,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:19:39,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:39,014 INFO L87 Difference]: Start difference. First operand 230 states and 340 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 02:19:39,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:19:39,262 INFO L93 Difference]: Finished difference Result 508 states and 742 transitions. [2024-11-12 02:19:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:19:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 199 [2024-11-12 02:19:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:19:39,270 INFO L225 Difference]: With dead ends: 508 [2024-11-12 02:19:39,270 INFO L226 Difference]: Without dead ends: 281 [2024-11-12 02:19:39,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:19:39,272 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 78 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:19:39,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 315 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:19:39,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-12 02:19:39,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 225. [2024-11-12 02:19:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 144 states have internal predecessors, (177), 78 states have call successors, (78), 4 states have call predecessors, (78), 4 states have return successors, (78), 76 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-12 02:19:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 333 transitions. [2024-11-12 02:19:39,315 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 333 transitions. Word has length 199 [2024-11-12 02:19:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:19:39,315 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 333 transitions. [2024-11-12 02:19:39,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-12 02:19:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 333 transitions. [2024-11-12 02:19:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-12 02:19:39,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:19:39,317 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:19:39,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:19:39,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:19:39,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:19:39,318 INFO L85 PathProgramCache]: Analyzing trace with hash 270096966, now seen corresponding path program 1 times [2024-11-12 02:19:39,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:19:39,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744591419] [2024-11-12 02:19:39,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:19:39,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:19:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat