./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.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 8b9b5c3584162f1ac164bc4062f8fb20bbcdce8e443da62cb4410d73442b6f23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 03:43:26,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 03:43:26,486 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 03:43:26,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 03:43:26,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 03:43:26,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 03:43:26,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 03:43:26,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 03:43:26,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 03:43:26,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 03:43:26,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 03:43:26,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 03:43:26,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 03:43:26,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 03:43:26,526 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 03:43:26,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 03:43:26,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 03:43:26,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 03:43:26,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 03:43:26,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 03:43:26,529 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 03:43:26,529 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 03:43:26,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 03:43:26,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 03:43:26,530 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 03:43:26,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 03:43:26,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 03:43:26,531 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 03:43:26,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 03:43:26,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 03:43:26,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 03:43:26,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 03:43:26,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:26,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 03:43:26,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 03:43:26,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 03:43:26,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 03:43:26,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 03:43:26,535 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 03:43:26,535 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 03:43:26,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 03:43:26,536 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 03:43:26,536 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 -> 8b9b5c3584162f1ac164bc4062f8fb20bbcdce8e443da62cb4410d73442b6f23 [2024-10-13 03:43:26,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 03:43:26,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 03:43:26,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 03:43:26,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 03:43:26,809 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 03:43:26,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i [2024-10-13 03:43:28,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 03:43:28,578 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 03:43:28,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i [2024-10-13 03:43:28,593 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1430ff9a/6bf1b06706874a18894227138fcbc6bf/FLAG77d50c3e5 [2024-10-13 03:43:28,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1430ff9a/6bf1b06706874a18894227138fcbc6bf [2024-10-13 03:43:28,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 03:43:28,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 03:43:28,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:28,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 03:43:28,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 03:43:28,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:28" (1/1) ... [2024-10-13 03:43:28,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3613faa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:28, skipping insertion in model container [2024-10-13 03:43:28,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 03:43:28" (1/1) ... [2024-10-13 03:43:28,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 03:43:28,840 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i[916,929] [2024-10-13 03:43:28,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:28,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 03:43:28,967 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-14.i[916,929] [2024-10-13 03:43:29,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 03:43:29,051 INFO L204 MainTranslator]: Completed translation [2024-10-13 03:43:29,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29 WrapperNode [2024-10-13 03:43:29,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 03:43:29,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:29,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 03:43:29,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 03:43:29,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,121 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 282 [2024-10-13 03:43:29,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 03:43:29,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 03:43:29,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 03:43:29,124 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 03:43:29,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,190 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 03:43:29,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,190 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,212 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 03:43:29,243 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 03:43:29,243 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 03:43:29,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 03:43:29,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (1/1) ... [2024-10-13 03:43:29,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 03:43:29,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 03:43:29,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 03:43:29,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 03:43:29,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 03:43:29,330 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 03:43:29,331 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 03:43:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 03:43:29,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 03:43:29,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 03:43:29,430 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 03:43:29,432 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 03:43:30,039 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-10-13 03:43:30,040 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 03:43:30,077 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 03:43:30,078 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 03:43:30,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:30 BoogieIcfgContainer [2024-10-13 03:43:30,079 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 03:43:30,082 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 03:43:30,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 03:43:30,086 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 03:43:30,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 03:43:28" (1/3) ... [2024-10-13 03:43:30,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e162968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:30, skipping insertion in model container [2024-10-13 03:43:30,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 03:43:29" (2/3) ... [2024-10-13 03:43:30,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e162968 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 03:43:30, skipping insertion in model container [2024-10-13 03:43:30,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 03:43:30" (3/3) ... [2024-10-13 03:43:30,090 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-14.i [2024-10-13 03:43:30,107 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 03:43:30,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 03:43:30,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 03:43:30,266 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;@5e8bbd35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 03:43:30,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 03:43:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 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-10-13 03:43:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 03:43:30,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:30,297 INFO L215 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-10-13 03:43:30,298 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:30,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:30,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1278449288, now seen corresponding path program 1 times [2024-10-13 03:43:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:30,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835200442] [2024-10-13 03:43:30,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:30,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:30,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:43:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:43:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:43:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:43:30,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:43:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:30,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:43:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:43:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 03:43:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:43:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:43:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:43:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:30,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:43:30,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:30,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835200442] [2024-10-13 03:43:30,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835200442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:30,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:30,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 03:43:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120963826] [2024-10-13 03:43:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:30,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 03:43:30,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:30,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 03:43:30,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:30,895 INFO L87 Difference]: Start difference. First operand has 109 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 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 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:43:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:30,950 INFO L93 Difference]: Finished difference Result 216 states and 378 transitions. [2024-10-13 03:43:30,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 03:43:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2024-10-13 03:43:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:30,962 INFO L225 Difference]: With dead ends: 216 [2024-10-13 03:43:30,963 INFO L226 Difference]: Without dead ends: 106 [2024-10-13 03:43:30,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 03:43:30,970 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:30,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:43:30,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-13 03:43:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-13 03:43:31,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 73 states have internal predecessors, (105), 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-10-13 03:43:31,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 167 transitions. [2024-10-13 03:43:31,020 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 167 transitions. Word has length 198 [2024-10-13 03:43:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:31,022 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 167 transitions. [2024-10-13 03:43:31,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:43:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 167 transitions. [2024-10-13 03:43:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 03:43:31,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:31,028 INFO L215 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-10-13 03:43:31,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 03:43:31,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:31,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:31,029 INFO L85 PathProgramCache]: Analyzing trace with hash -350745722, now seen corresponding path program 1 times [2024-10-13 03:43:31,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:31,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189073234] [2024-10-13 03:43:31,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:31,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:43:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:43:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:43:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:43:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:43:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:43:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:43:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 03:43:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:43:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:43:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:43:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:43:31,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189073234] [2024-10-13 03:43:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189073234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 03:43:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303332900] [2024-10-13 03:43:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:31,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 03:43:31,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:31,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 03:43:31,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:43:31,586 INFO L87 Difference]: Start difference. First operand 106 states and 167 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-10-13 03:43:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:31,657 INFO L93 Difference]: Finished difference Result 212 states and 335 transitions. [2024-10-13 03:43:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:43:31,658 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-10-13 03:43:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:31,661 INFO L225 Difference]: With dead ends: 212 [2024-10-13 03:43:31,664 INFO L226 Difference]: Without dead ends: 107 [2024-10-13 03:43:31,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 03:43:31,666 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 4 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:31,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 471 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 03:43:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-13 03:43:31,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-13 03:43:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 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-10-13 03:43:31,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 168 transitions. [2024-10-13 03:43:31,691 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 168 transitions. Word has length 198 [2024-10-13 03:43:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:31,693 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 168 transitions. [2024-10-13 03:43:31,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-10-13 03:43:31,694 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 168 transitions. [2024-10-13 03:43:31,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 03:43:31,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:31,700 INFO L215 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-10-13 03:43:31,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 03:43:31,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:31,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:31,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1011597977, now seen corresponding path program 1 times [2024-10-13 03:43:31,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:31,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814534028] [2024-10-13 03:43:31,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:31,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:35,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:35,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:43:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:43:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:43:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:43:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:43:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:35,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:35,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:43:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:43:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 03:43:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:43:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:43:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:43:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:43:35,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:35,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814534028] [2024-10-13 03:43:35,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814534028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:35,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:35,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 03:43:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301195289] [2024-10-13 03:43:35,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:35,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 03:43:35,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:35,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 03:43:35,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 03:43:35,857 INFO L87 Difference]: Start difference. First operand 107 states and 168 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:43:37,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:37,377 INFO L93 Difference]: Finished difference Result 327 states and 511 transitions. [2024-10-13 03:43:37,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 03:43:37,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 199 [2024-10-13 03:43:37,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:37,381 INFO L225 Difference]: With dead ends: 327 [2024-10-13 03:43:37,381 INFO L226 Difference]: Without dead ends: 221 [2024-10-13 03:43:37,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-10-13 03:43:37,388 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 368 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:37,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 710 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 03:43:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-10-13 03:43:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 217. [2024-10-13 03:43:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 149 states have (on average 1.4161073825503356) internal successors, (211), 150 states have internal predecessors, (211), 64 states have call successors, (64), 3 states have call predecessors, (64), 3 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 03:43:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 339 transitions. [2024-10-13 03:43:37,439 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 339 transitions. Word has length 199 [2024-10-13 03:43:37,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:37,441 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 339 transitions. [2024-10-13 03:43:37,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 03:43:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 339 transitions. [2024-10-13 03:43:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-10-13 03:43:37,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:37,447 INFO L215 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, 1] [2024-10-13 03:43:37,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 03:43:37,447 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:37,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:37,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1362970786, now seen corresponding path program 1 times [2024-10-13 03:43:37,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:37,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372538002] [2024-10-13 03:43:37,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:37,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:43:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:43:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:43:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:43:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:43:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:43:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:43:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:43:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:43:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:43:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:43:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:43:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:43:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:43:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:43:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:43:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:43:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:43:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:43:38,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:43:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:43:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:43:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:43:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:43:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:43:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:43:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:43:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 03:43:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:43:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:43:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:43:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:43:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:43:38,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:43:38,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372538002] [2024-10-13 03:43:38,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372538002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:43:38,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:43:38,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 03:43:38,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633860498] [2024-10-13 03:43:38,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:43:38,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 03:43:38,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:43:38,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 03:43:38,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 03:43:38,549 INFO L87 Difference]: Start difference. First operand 217 states and 339 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-10-13 03:43:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:43:38,778 INFO L93 Difference]: Finished difference Result 328 states and 510 transitions. [2024-10-13 03:43:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 03:43:38,780 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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 200 [2024-10-13 03:43:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:43:38,783 INFO L225 Difference]: With dead ends: 328 [2024-10-13 03:43:38,786 INFO L226 Difference]: Without dead ends: 222 [2024-10-13 03:43:38,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 03:43:38,788 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 130 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 03:43:38,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 409 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 03:43:38,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-13 03:43:38,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2024-10-13 03:43:38,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 153 states have internal predecessors, (213), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 03:43:38,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 341 transitions. [2024-10-13 03:43:38,834 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 341 transitions. Word has length 200 [2024-10-13 03:43:38,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:43:38,836 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 341 transitions. [2024-10-13 03:43:38,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 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-10-13 03:43:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 341 transitions. [2024-10-13 03:43:38,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:43:38,839 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:43:38,839 INFO L215 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, 1, 1] [2024-10-13 03:43:38,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 03:43:38,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:43:38,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:43:38,840 INFO L85 PathProgramCache]: Analyzing trace with hash -870558658, now seen corresponding path program 1 times [2024-10-13 03:43:38,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:43:38,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236555039] [2024-10-13 03:43:38,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:43:38,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:43:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 03:44:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 03:44:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 03:44:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 03:44:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 03:44:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 03:44:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 03:44:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 03:44:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 03:44:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 03:44:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 03:44:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 03:44:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-13 03:44:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-13 03:44:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-13 03:44:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-13 03:44:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-13 03:44:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-13 03:44:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-13 03:44:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-13 03:44:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-13 03:44:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-13 03:44:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-13 03:44:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-13 03:44:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-13 03:44:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-13 03:44:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 03:44:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 03:44:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-13 03:44:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-13 03:44:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-13 03:44:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 03:44:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 03:44:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 03:44:36,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236555039] [2024-10-13 03:44:36,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236555039] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 03:44:36,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 03:44:36,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 03:44:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280705046] [2024-10-13 03:44:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 03:44:36,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 03:44:36,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 03:44:36,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 03:44:36,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-13 03:44:36,476 INFO L87 Difference]: Start difference. First operand 221 states and 341 transitions. Second operand has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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-10-13 03:44:47,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 03:44:47,787 INFO L93 Difference]: Finished difference Result 917 states and 1384 transitions. [2024-10-13 03:44:47,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 03:44:47,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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 201 [2024-10-13 03:44:47,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 03:44:47,794 INFO L225 Difference]: With dead ends: 917 [2024-10-13 03:44:47,795 INFO L226 Difference]: Without dead ends: 700 [2024-10-13 03:44:47,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2024-10-13 03:44:47,798 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1028 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 03:44:47,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 747 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 03:44:47,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-13 03:44:47,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 418. [2024-10-13 03:44:47,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 319 states have (on average 1.432601880877743) internal successors, (457), 322 states have internal predecessors, (457), 90 states have call successors, (90), 8 states have call predecessors, (90), 8 states have return successors, (90), 87 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-13 03:44:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 637 transitions. [2024-10-13 03:44:47,857 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 637 transitions. Word has length 201 [2024-10-13 03:44:47,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 03:44:47,858 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 637 transitions. [2024-10-13 03:44:47,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 15 states have internal predecessors, (49), 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-10-13 03:44:47,858 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 637 transitions. [2024-10-13 03:44:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-13 03:44:47,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 03:44:47,861 INFO L215 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, 1, 1] [2024-10-13 03:44:47,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 03:44:47,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 03:44:47,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 03:44:47,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1263585668, now seen corresponding path program 1 times [2024-10-13 03:44:47,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 03:44:47,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217567975] [2024-10-13 03:44:47,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 03:44:47,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 03:44:48,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat